A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Hamiltonian degree sequences in digraphs
2010
Journal of combinatorial theory. Series B (Print)
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out-and indegree sequences d + This gives an approximate solution to a problem of Nash- Williams (1975) [22] concerning a digraph analogue of Chvátal's theorem. In fact, we prove the stronger result that such digraphs G are pancyclic.
doi:10.1016/j.jctb.2009.11.004
fatcat:pag54l7krbcydnvyl4avvbihva