×

zbMATH — the first resource for mathematics

Long paths and cycles in oriented graphs. (English) Zbl 0458.05041

MSC:
05C38 Paths and cycles
05C20 Directed graphs (digraphs), tournaments
05C45 Eulerian and Hamiltonian graphs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bermond, Ann Discrete Math.
[2] Dirac, Proc. London Math. Soc. 2 pp 69– (1952)
[3] Jackson, Ann. Discrete Math.
[4] Topics in Tournaments. Holt, Rinehart and Winston, New York (1968).
[5] Valency sequences which force graphs to have hamiltonian circuits: Interim Report. University of Waterloo Research Report (1969).
[6] On the number of hamiltonian cycles in tournaments. University of Aarhus, Mathematics Institute. Preprint 23.
[7] Thomassen, J. London Math. Soc.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.