A note on Hamiltonian cycles in planar graphs

DOI10.1142/s1793830922500604zbMath1516.05114OpenAlexW4212928753WikidataQ114071635 ScholiaQ114071635MaRDI QIDQ6174139

Martin Kreh

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500604

zbMATH Keywords

Hamiltonian cycleplanar graphDiophantine equation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Linear Diophantine equations (11D04) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Higher mathematics with the beam scale
• Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
• A Survey on Hamiltonian Cycles
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• A Sharp Bound for Solutions of Linear Diophantine Equations
• Updating the hamiltonian problem—A survey

This page was built for publication: A note on Hamiltonian cycles in planar graphs