Sufficient conditions for a digraph to be Hamiltonian

Gutin, Gregory, Bang-Jensen, J. and Li, H.

(1996)

Gutin, Gregory, Bang-Jensen, J. and Li, H. (1996) Sufficient conditions for a digraph to be Hamiltonian. Journal of Graph Theory, 22 (2).

Our Full Text Deposits

Full text access: Open

Full Text - 134.44 KB

Links to Copies of this Item Held Elsewhere

Link to Publisher Copy

Abstract

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.

Information about this Version

This is a Submitted version
This version's date is: 1996
This item is not peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/a91f90be-9481-a263-dac8-91b119566c5d/4/

Item TypeJournal Article
TitleSufficient conditions for a digraph to be Hamiltonian
AuthorsGutin, Gregory
Bang-Jensen, J.
Li, H.
Uncontrolled Keywordsdigraph, Hamiltonian, nonadjacent vertices, Ghouila-Houri, Woodall
DepartmentsFaculty of Science\Computer Science

Identifiers
doihttp://dx.doi.org/10.1002/(SICI)1097-0118(199606)22:2<181::AID-JGT9>3.0.CO;2-J

Deposited by Research Information System (atira) on 25-Jul-2012 in Royal Holloway Research Online.Last modified on 25-Jul-2012

Details