A lower bound on the number of hamiltonian cycles

DOI10.1016/S0012-365X(00)00060-1zbMath0958.05082OpenAlexW2008768155MaRDI QIDQ1579572

Ladislav Stacho, Peter Horák

Publication date: 30 March 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00060-1

zbMATH Keywords

\(r\)-regular graphssecond hamiltonian cycle

Mathematics Subject Classification ID

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

Related Items (3)

An improved degree based condition for Hamiltonian cycles ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ From one to many rainbow Hamiltonian cycles

This page was built for publication: A lower bound on the number of hamiltonian cycles