A Chvátal-Erdős condition for Hamilton cycles in digraphs

DOI10.1016/0095-8956(87)90001-3zbMath0632.05037OpenAlexW2076025721MaRDI QIDQ1095153

Bill Jackson

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90001-3

zbMATH Keywords

independence numberHamiltonian digraphconnectivity number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A survey on Hamilton cycles in directed graphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey

Cites Work

• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• A note on Hamiltonian circuits
• Long Cycles in Digraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A Chvátal-Erdős condition for Hamilton cycles in digraphs