On the number of Hamiltonian cycles in Dirac graphs

DOI10.1016/S0012-365X(02)00582-4zbMath1013.05043OpenAlexW2122689704MaRDI QIDQ1874364

Gábor N. Sárközy, Endre Szemerédi, Stanley M. Selkow

Publication date: 25 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00582-4

zbMATH Keywords

Hamiltonian cyclenumber of Hamiltonian cyclesminimum number of Hamiltonian cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Counting Hamilton cycles in Dirac hypergraphs ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ The number of bounded‐degree spanning trees ⋮ Entropy bounds for perfect matchings and Hamiltonian cycles ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ On 2-factors with \(k\) components ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Hamiltonian cycles in Dirac graphs ⋮ Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Long paths and cycles in random subgraphs of graphs with large minimum degree

This page was built for publication: On the number of Hamiltonian cycles in Dirac graphs