On the Hamiltonian number of a plane graph

DOI10.7151/dmgt.2084zbMath1401.05085arXiv1508.06892OpenAlexW2964228578WikidataQ129888070 ScholiaQ129888070MaRDI QIDQ1630935

Thomas M. Lewis

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian cycleplanar graphHamiltonian numberGrinberg's theoremHamiltonian spectrumHamiltonian walk

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Hamiltonian numbers of Möbius double loop networks
• On cubic planar hypohamiltonian and hypotraceable graphs
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• The Hamiltonian numbers in digraphs
• On planar hypohamiltonian graphs
• Measures of traceability in graphs
• The upper traceable number of a graph
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• Advances on the Hamiltonian Completion Problem
• The Hamiltonian Number of Cubic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Hamiltonian number of a plane graph