Compatible Hamilton cycles in Dirac graphs

DOI10.1007/s00493-016-3328-7zbMath1399.05143arXiv1410.1435OpenAlexW2293139534MaRDI QIDQ681601

Michael Krivelevich, Choongbum Lee, Benjamin Sudakov

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

compatible Hamilton cyclesrobustness of graph propertiestheorem of Dirac

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Graph Tilings in Incompatibility Systems ⋮ Properly colored Hamilton cycles in Dirac-type hypergraphs ⋮ A Rainbow Dirac's Theorem ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting and packing Hamilton cycles in dense graphs and oriented graphs
• Edge-disjoint Hamilton cycles in graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Hamiltonian cycles in Dirac graphs
• Graphs with cycles having adjacent lines different colors
• A sufficient condition for Hamiltonian circuits
• Hamiltonian circuits in random graphs
• Alternating Hamiltonian cycles
• A property of the colored complete graph
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• On prisms, Möbius ladders and the cycle space of dense graphs
• Compatible Hamilton cycles in random graphs
• Local resilience of graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Robust Hamiltonicity of Dirac graphs

This page was built for publication: Compatible Hamilton cycles in Dirac graphs