Graphs with few hamiltonian cycles
From MaRDI portal
Publication:5207451
DOI10.1090/mcom/3465zbMath1429.05114arXiv1812.05650OpenAlexW2905023271MaRDI QIDQ5207451
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
Publication date: 27 December 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.05650
cubic graphHamiltonian cyclegirthexhaustive generationuniquely HamiltonianBondy-Jackson conjectureuniquely traceable
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
On interval transmission irregular graphs ⋮ Switching 3-edge-colorings of cubic graphs ⋮ Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs ⋮ Regular Graphs with Few Longest Cycles ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ K2‐Hamiltonian graphs: II ⋮ Unnamed Item
Uses Software
Cites Work
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- A degree constraint for uniquely Hamiltonian graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- Spanning cycles of nearly cubic graphs
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- House of Graphs: a database of interesting graphs
- Highly-connected planar cubic graphs with few or many Hamilton cycles
- On uniquely Hamiltonian claw-free and triangle-free graphs
- Practical graph isomorphism. II.
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- Uniquely Hamiltonian Graphs of Minimum Degree 4
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Independent dominating sets and hamiltonian cycles
- A census of maximum uniquely hamiltonian graphs
- Graphs with exactly one hamiltonian circuit
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- Fast generation of regular graphs and construction of cages
- Isomorph-Free Exhaustive Generation
- On the Minimum Number of Hamiltonian Cycles in Regular Graphs
- Generation of Cubic Graphs and Snarks with Large Girth
- The Generation of Fullerenes
- On Hamiltonian Circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs with few hamiltonian cycles
