Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
From MaRDI portal
Publication:547792
zbMath1219.05077MaRDI QIDQ547792
Publication date: 24 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/224902
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
A randomized construction of high girth regular graphs ⋮ Finding and enumerating Hamilton cycles in 4-regular graphs ⋮ New Steiner 2-designs from old ones by paramodifications ⋮ Special Frequency Quadrilaterals and an Application ⋮ The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
This page was built for publication: Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
