Regular Graphs with Few Longest Cycles
From MaRDI portal
Publication:5067426
DOI10.1137/21M1414048zbMath1486.05174arXiv2104.10020OpenAlexW3154261796MaRDI QIDQ5067426
Publication date: 1 April 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.10020
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- Non-Hamiltonian 3-connected cubic bipartite graphs
- Spanning cycles of nearly cubic graphs
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- On the number of cycles in 3-connected cubic graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- Long cycles in Hamiltonian graphs
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
- Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs
- Highly-connected planar cubic graphs with few or many Hamilton cycles
- Regular non-Hamiltonian polyhedral graphs
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- Uniquely Hamiltonian Graphs of Minimum Degree 4
- Independent dominating sets and hamiltonian cycles
- On the number of Hamiltonian cycles in triangulations
- On the number of hamiltonian cycles in a maximal planar graph
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- On the Minimum Number of Hamiltonian Cycles in Regular Graphs
- 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles
- Graphs with few hamiltonian cycles
- On Hamiltonian Circuits
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
This page was built for publication: Regular Graphs with Few Longest Cycles