| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657180 | Journal of Combinatorial Theory, Series B | 2010 | 14 Pages |
Abstract
We show that for each η>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences and satisfy (i) or and (ii) or for all i
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
