An Ore-type condition for arbitrarily vertex decomposable graphs

Note on Hamilton Circuits

Öystein Ore · American Mathematical Monthly · 1960 · 743 citations

Circuit Complexity, Hamiltonian Theory, Discrete Mathematics +2

A homology theory for spanning tress of a graph

László Lovász · Acta Mathematica Academiae Scientiarum Hungaricae · 1977 · 119 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +2

A degree bound on decomposable trees

Dominique Barth, Hervé Fournier · Discrete Mathematics · 2006 · 44 citations

Mathematical Programming, Tree Language, Engineering +8

Decomposable trees: a polynomial algorithm for tripodes

Dominique Barth, Olivier Baudon, J. Puech · Discrete Applied Mathematics · 2002 · 40 citations

Mathematical Programming, Computational Complexity Theory, Engineering +8

ARBITRARILY VERTEX DECOMPOSABLE TREES ARE OF MAXIMUM DEGREE AT MOST SIX

Mirko Horňák, Mariusz Woźniak · Opuscula Mathematica · 2003 · 30 citations

Graph Minor, Graph Theory, Algebraic Graph Theory +8