An upper bound on the length of a Hamiltonian walk of a maximal planar graph
From MaRDI portal
Publication:3870928
DOI10.1002/jgt.3190040310zbMath0433.05037OpenAlexW2012463371MaRDI QIDQ3870928
Takahiro Watanabe, Takao Asano, Takao Nishizeki
Publication date: 1980
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190040310
upper boundHamiltonian cycletraveling salesman problemmaximal planar graphlength of a Hamiltonian walk
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
On the Hamiltonian number of a plane graph ⋮ The Hamiltonian Number of Cubic Graphs ⋮ Hamiltonian numbers in oriented graphs ⋮ Hamiltonian numbers of Möbius double loop networks ⋮ The Hamiltonian numbers in digraphs ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ Hamiltonian spectra of graphs ⋮ The upper traceable number of a graph ⋮ An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs ⋮ Unnamed Item
Cites Work
This page was built for publication: An upper bound on the length of a Hamiltonian walk of a maximal planar graph
