Hamiltonian cycles in Dirac graphs

DOI10.1007/s00493-009-2360-2zbMath1212.05146MaRDI QIDQ987558

Bill Cuckler, Jeffry Kahn

Publication date: 13 August 2010

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-2360-2

zbMATH Keywords

Hamiltonian cyclesDirac graphs

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C45: Eulerian and Hamiltonian graphs

Related Items

Long paths and cycles in random subgraphs of graphs with large minimum degree, Robust Hamiltonicity of Dirac graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Counting Hamilton cycles in Dirac hypergraphs, The number of bounded‐degree spanning trees, Counting and packing Hamilton cycles in dense graphs and oriented graphs, Entropy bounds for perfect matchings and Hamiltonian cycles, Compatible Hamilton cycles in Dirac graphs, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, The number of Hamiltonian decompositions of regular graphs, Proof of Komlós's conjecture on Hamiltonian subsets, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Threshold Ramsey multiplicity for paths and even cycles, From one to many rainbow Hamiltonian cycles, Recent advances on the Hamiltonian problem: survey III, On prisms, Möbius ladders and the cycle space of dense graphs, Random directed graphs are robustly Hamiltonian, Compatible Hamilton cycles in random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy bounds for perfect matchings and Hamiltonian cycles
• Hamilton connected graphs
• On a packing and covering problem
• Random matchings in regular graphs
• On the number of Hamiltonian cycles in Dirac graphs
• On Hamiltonian bipartite graphs
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Hamiltonian Cycles in Regular Tournaments
• Some Theorems on Abstract Graphs
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• Graph colouring and the probabilistic method