Finding Hamilton cycles in robustly expanding digraphs

DOI10.7155/jgaa.00261zbMath1254.05090OpenAlexW2109266036MaRDI QIDQ3143742

Deryk Osthus, Daniela Kühn, Peter Keevash, Demetres Christofides

Publication date: 4 December 2012

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00261

zbMATH Keywords

Hamilton decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Degree sequences forcing Hamilton cycles in directed graphs

This page was built for publication: Finding Hamilton cycles in robustly expanding digraphs