Hamiltonicity in connected regular graphs

DOI10.1016/j.ipl.2013.08.005zbMath1284.05156arXiv1204.6457OpenAlexW2025175868MaRDI QIDQ2445323

Daniel W. Cranston, Suil O

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6457

zbMATH Keywords

combinatorial problemsregular graphsHamiltonicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

The number of bounded‐degree spanning trees ⋮ Open global shadow graph and it’s zero forcing number ⋮ Non-empty intersection of longest paths in \(H\)-free graphs

Cites Work

• Matching and edge-connectivity in regular graphs
• Hamilton cycles in regular 2-connected graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Cycles through vertices of large maximum degree
• Unnamed Item

This page was built for publication: Hamiltonicity in connected regular graphs