Two New Classes of Hamiltonian Graphs: (Extended Abstract)

d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Valentin Polishchuk 3 Helsinki Institute for Information Technology University of Helsinki Helsinki, Finland We prove that a triangular grid without local cuts is (almost) always Hamiltonian. This suggests an efficient scheme for rendering triangulated manifolds by graphics hardware. We also show that the Hamiltonian Cycle problem is NP-Complete for planar subcubic graphs of arbitrarily high girth. As a by-product we prove that there exist tri-Hamiltonian planar subcubic graphs of arbitrarily high girth.

• Type: Journal
• Year: 2007
• Where: ENDM
• Authors: Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk
• Keywords: ENDM 2007, Statistics Stony Brook, Stony Brook, Stony Brook University