Journal of Graph Theory · 1996 · 36 citations · 7 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDynamical SystemsTopologyDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHamiltonian SystemsConditionsHamiltonian GraphsLocal Hamiltonian ProblemLocal Structure
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs of nonadjacent vertices. Our results generalize the classical conditions by Ghouila-Houri and Woodall. © 1996 John Wiley & Sons, Inc.
7
Jørgen Bang‐Jensen, Jing Huang · Journal of Graph Theory · 1995 · 110 citations
A short proof of Meyniel's theorem
J. A. Bondy, Carsten Thomassen · Discrete Mathematics · 1977 · 42 citations
Yannis Manoussakis · Journal of Graph Theory · 1992 · 26 citations