On planar regular graphs degree three without Hamiltonian cycles
Emanuels Grinbergs (IMCS)

TL;DR
This paper explores the conditions under which planar regular graphs of degree three lack Hamiltonian cycles, providing necessary conditions and constructing specific examples of such graphs.
Contribution
It introduces a necessary condition for the existence of Hamiltonian cycles in these graphs and constructs explicit examples without such cycles.
Findings
Identified a necessary condition for Hamiltonian cycles in planar degree-three graphs.
Constructed explicit examples of planar regular graphs of degree three without Hamiltonian cycles.
Abstract
Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Structural Analysis and Optimization
