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

04/17/2021
by   Dario Cavallaro, et al.
0

We prove that 3-Coloring remains NP-hard on 4- and 5-regular planar Hamiltonian graphs, strengthening the results of Dailey [Disc. Math.'80] and Fleischner and Sabidussi [J. Graph. Theor.'02]. Moreover, we prove that 3-Coloring remains NP-hard on p-regular Hamiltonian graphs for every p≥ 6 and p-ordered regular Hamiltonian graphs for every p≥ 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

Feedback Vertex Set on Hamiltonian Graphs

We study the computational complexity of Feedback Vertex Set on subclass...
research
06/21/2001

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

We show that computing the lexicographically first four-coloring for pla...
research
09/30/2019

Hamiltonicity in Semi-Regular Tessellation Dual Graphs

This paper shows NP-completeness for finding Hamiltonian cycles in induc...
research
01/17/2019

Hamiltonian chromatic number of block graphs

Let G be a simple connected graph of order n. A hamiltonian coloring c o...
research
07/09/2021

Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives

Proximity graphs have been studied for several decades, motivated by app...
research
10/02/2021

Minimizing LR(1) State Machines is NP-Hard

LR(1) parsing was a focus of extensive research in the past 50 years. Th...
research
11/17/2022

AlphaSnake: Policy Iteration on a Nondeterministic NP-hard Markov Decision Process

Reinforcement learning has recently been used to approach well-known NP-...

Please sign up or login with your details

Forgot password? Click here to reset