Four-coloring P_6-free graphs. II. Finding an excellent precoloring

02/07/2018
by   Maria Chudnovsky, et al.
0

This is the second paper in a series of two. The goal of the series is to give a polynomial time algorithm for the 4-coloring problem and the 4-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the 4-coloring problem for graphs with a connected forbidden induced subgraph. In this paper we give a polynomial time algorithm that starts with a 4-precoloring of a graph with no induced six-vertex path, and outputs a polynomial-size collection of so-called excellent precolorings. Excellent precolorings are easier to handle than general ones, and, in addition, in order to determine whether the initial precoloring can be extended to the whole graph, it is enough to answer the same question for each of the excellent precolorings in the collection. The first paper in the series deals with excellent precolorings, thus providing a complete solution to the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2018

Four-coloring P_6-free graphs. I. Extending an excellent precoloring

This is the first paper in a series whose goal is to give a polynomial t...
research
06/04/2020

List-three-coloring P_t-free graphs with no induced 1-subdivision of K_1,s

Let s and t be positive integers. We use P_t to denote the path with t v...
research
09/22/2017

Polynomial Cases for the Vertex Coloring Problem

The computational complexity of the Vertex Coloring problem is known for...
research
04/20/2020

Finding large H-colorable subgraphs in hereditary graph classes

We study the Max Partial H-Coloring problem: given a graph G, find the l...
research
07/27/2023

3-Coloring C_4 or C_3-free Diameter Two Graphs

The question of whether 3-Coloring can be solved in polynomial-time for ...
research
04/14/2020

Hierarchical and Modularly-Minimal Vertex Colorings

Cographs are exactly the hereditarily well-colored graphs, i.e., the gra...
research
07/20/2023

The Complexity of (P_k, P_ℓ)-Arrowing

For fixed nonnegative integers k and ℓ, the (P_k, P_ℓ)-Arrowing problem ...

Please sign up or login with your details

Forgot password? Click here to reset