Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs

zbMATH Open1219.05077MaRDI QIDQ547792FDOQ547792

Authors: Heidi Gebauer 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On the number of Hamilton cycles in bounded degree graphs
• Finding and enumerating Hamilton cycles in 4-regular graphs
• Hamilton cycles in regular 3-connected graphs
• Generating and Counting Hamilton Cycles in Random Regular Graphs
• Enumerating Hamiltonian cycles

zbMATH Keywords

algorithmenumerationHamilton cyclesmaximum numberpartial Hamilton cycles

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cited In (8)

• Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
• A randomized construction of high girth regular graphs
• Finding and enumerating Hamilton cycles in 4-regular graphs
• Special Frequency Quadrilaterals and an Application
• On the construction and enumeration of Hamiltonian graphs
• New Steiner 2-designs from old ones by paramodifications
• Estimation of the number of Hamiltonian cycles in regular graphs of special type
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547792)