DeepAI AI Chat
Log In Sign Up

Hamiltonicity in Semi-Regular Tessellation Dual Graphs

09/30/2019
by   Divya Gopinath, et al.
MIT
0

This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows up on prior studies of the complexity of finding Hamiltonian cycles in regular and semi-regular grid graphs.

READ FULL TEXT

page 3

page 4

page 5

page 6

page 10

05/08/2018

The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations

Finding Hamitonian Cycles in square grid graphs is a well studied and im...
04/17/2021

3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs

We prove that 3-Coloring remains NP-hard on 4- and 5-regular planar Hami...
11/15/2022

Few hamiltonian cycles in graphs with one or two vertex degrees

We fully disprove a conjecture of Haythorpe on the minimum number of ham...
08/13/2020

On graphs of bounded degree that are far from being Hamiltonian

Hamiltonian cycles in graphs were first studied in the 1850s. Since then...
10/19/2017

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...
10/10/2018

Alternating Hamiltonian cycles in 2-edge-colored multigraphs

A path (cycle) in a c-edge-colored multigraph is alternating if no two c...
06/20/2019

Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs

A graph-theoretic parameter, in a form of a function, called the extra-f...