MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Sufficient Conditions for a Digraph to be Hamiltonian (1996) [15 citations — 7 self]

Download:
Download as a PDF | Download as a PS
by Gregory Gutin, Hao Li
J. Graph Theory
ftp://ftp.brunel.ac.uk/maths/pub/sufdi3.ps
Add To MetaCart

Abstract:

This paper is dedicated to the memory of Henri Meyniel 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 non-adjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs of non-adjacent vertices. Our results generalize the classical conditions by Ghouila-Houri and Woodall. 1

Citations

901 Graph Theory with Applications – Bondy, Murty - 1976
25 In-tournament digraphs – Bang-Jensen, Huang, et al. - 1993
19 New sufficient conditions for cycles in graphs – Fan - 1984
17 Locally semicomplete digraphs: a generalization of tournaments – Bang-Jensen - 1990
13 A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, Discrete Math – Bang-Jensen, Gutin, et al. - 1996
10 A classification of locally semicomplete digraphs – Bang-Jensen, Guo, et al. - 1997
10 Basic graph theory: paths and circuits, in: Handbook of combinatorics, Volume 1 – Bondy - 1995
8 Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe orient'e – Meyniel - 1973
7 Une condition suffisante d'existence d'un circuit hamiltonien – Ghouila-Houri - 1960
6 A short proof of Meyniel's theorem – Bondy, Thomassen - 1977
5 On k-strong and k-cyclic Digraphs – Bang-Jensen, Gutin, et al. - 1996
4 Directed Hamiltonian graphs – Manoussakis - 1992
4 Sufficient conditions for cycles in digraphs – Woodall - 1972
2 An improvement of Fraisse’s sufficient condition for hamiltonian graphs – Ainouche - 1992
View or Download | Add to My Collection | Correct Errors