The Hamiltonian Number of Cubic Graphs

DOI10.1007/978-3-540-89550-3_23zbMath1162.05332OpenAlexW122548852MaRDI QIDQ5302756

Narong Punnim, Sermsri Thaithae

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89550-3_23

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

On the Hamiltonian number of a plane graph ⋮ Hamiltonian numbers in oriented graphs ⋮ Hamiltonian numbers of Möbius double loop networks ⋮ The Hamiltonian numbers in digraphs ⋮ Hamiltonian spectra of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The classification of Hamiltonian generalized Petersen graphs
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• On Hamiltonian Walks in Graphs

This page was built for publication: The Hamiltonian Number of Cubic Graphs