Concepedia
European Journal of Combinatorics · 2011 · 49 citations · 23 references
Natural SciencesMathematicsCombinatoricsTopologyDirected Acyclic GraphsGeometric GraphsGraph AlgorithmsGraph TheoryHamiltonian SystemsHamiltonian CyclesHamiltonian Path AlgorithmsHamiltonian Path ProblemHamiltonian PathsLine Graphs
23
Edge-Disjoint Spanning Trees of Finite Graphs
C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 805 citations
Natural Sciences, Mathematics, Combinatorics +7
On the Problem of Decomposing a Graph into <i>n</i> Connected Factors
W. T. Tutte · Journal of the London Mathematical Society · 1961 · 669 citations
Natural Sciences, Computer Science, Mathematics +7
On Eulerian and Hamiltonian Graphs and Line Graphs
Frank Harary, C. St. J. A. Nash‐Williams · Canadian Mathematical Bulletin · 1965 · 338 citations · Full text
Natural Sciences, Computer Science, Mathematics +11
On a Closure Concept in Claw-Free Graphs
Zdeněk Ryjáček · Journal of Combinatorial Theory Series B · 1997 · 303 citations
Natural Sciences, Computer Science, Mathematics +6
Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs
Manton M. Matthews, David P. Sumner · Journal of Graph Theory · 1984 · 233 citations
Natural Sciences, Computer Science, Mathematics +8