Semi-degree threshold for anti-directed Hamiltonian cycles

zbMath1329.05127arXiv1308.0269MaRDI QIDQ907223

Theodore Molla, Louis DeBiasio

Publication date: 25 January 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.0269

zbMATH Keywords

graph theoryHamiltonian cyclesdirected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Spanning trees of dense directed graphs ⋮ Arbitrary Orientations of Hamilton Cycles in Digraphs ⋮ Spanning trees in dense directed graphs ⋮ Packing and counting arbitrary Hamilton cycles in random digraphs ⋮ Anti-Eulerian digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• A counterexample to a conjecture of Grant
• 2-factors in dense bipartite graphs
• Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
• Vertex-oriented Hamilton cycles in directed graphs
• Antidirected Hamilton circuits and paths in tournaments
• On Hamiltonian bipartite graphs
• Oriented hamilton cycles in digraphs
• Some Theorems on Abstract Graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Semi-degree threshold for anti-directed Hamiltonian cycles