The Hamiltonian Number of Cubic Graphs
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 95322 (Why is no real title available?)
- scientific article; zbMATH DE number 3515497 (Why is no real title available?)
- scientific article; zbMATH DE number 2109324 (Why is no real title available?)
- On Hamiltonian Walks in Graphs
- The classification of Hamiltonian generalized Petersen graphs
Cited in
(14)- On the Hamiltonian number of a plane graph
- Hamiltonian numbers in oriented graphs
- The Hamiltonian numbers in digraphs
- Hamiltonian spectra of graphs
- On cubic 2-independent Hamiltonian connected graphs
- The Hamiltonian numbers in graphs.
- The Hamiltonian number of some classes of cubic graphs
- The Hamiltonian number of graphs with prescribed connectivity
- Hamiltonian numbers of Möbius double loop networks
- scientific article; zbMATH DE number 1463399 (Why is no real title available?)
- scientific article; zbMATH DE number 2107092 (Why is no real title available?)
- Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
- Hamiltonian walks and Hamiltonian-connected 3-path graphs
- On reduced Hamilton walks
This page was built for publication: The Hamiltonian Number of Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302756)