Journal of Graph Theory · 1992 · 26 citations · 2 references
Natural SciencesMathematicsCombinatoricsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHamiltonian SystemsDirected GraphsHamiltonian GraphsNode Degree
Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.
2
A short proof of Meyniel's theorem
J. A. Bondy, Carsten Thomassen · Discrete Mathematics · 1977 · 42 citations