Degree sequences forcing Hamilton cycles in directed graphs

DOI10.1016/J.ENDM.2009.07.057zbMath1273.05043OpenAlexW2089684689MaRDI QIDQ2851487

Andrew Treglown, Daniela Kühn, Deryk Osthus

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.057

zbMATH Keywords

directed graphsHamilton cyclesdegree sequences

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian degree sequences in digraphs
• On Hamilton's ideals
• Finding Hamilton cycles in robustly expanding digraphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Cycles in digraphs– a survey

This page was built for publication: Degree sequences forcing Hamilton cycles in directed graphs