Sufficient conditions for a digraph to be Hamiltonian

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

Similar works

Full text

thumbnail-image

Royal Holloway Research Online

redirect
Last time updated on 06/03/2017

This paper was published in Royal Holloway Research Online.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.