Dynamic 3-Coloring of Claw-free Graphs

TL;DR

This paper studies the complexity and algorithms for dynamic 3-coloring of claw-free graphs, proving NP-completeness in general but providing efficient solutions for a specific subclass.

Contribution

It establishes NP-completeness for dynamic 3-coloring of certain claw-free graphs and offers linear-time algorithms for recognizing and coloring a special subclass.

Findings

NP-complete to determine dynamic 3-colorability in general

Linear-time algorithms for recognizing and coloring a subclass

Identification of a subclass where dynamic 3-coloring is efficiently solvable

Abstract

A {\it dynamic $k$-coloring} of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex of degree at least 2 in $G$ will be adjacent to vertices with at least 2 different colors. The smallest number $k$ for which a graph $G$ can have a dynamic $k$-coloring is the {\it dynamic chromatic number}, denoted by $\chi_d(G)$. In this paper, we investigate the dynamic 3-colorings of claw-free graphs. First, we prove that it is $NP$-complete to determine if a claw-free graph with maximum degree 3 is dynamically 3-colorable. Second, by forbidding a kind of subgraphs, we find a reasonable subclass of claw-free graphs with maximum degree 3, for which the dynamically 3-colorable problem can be solved in linear time. Third, we give a linear time algorithm to recognize this subclass of graphs, and a linear time algorithm to determine whether it is dynamically 3-colorable. We also give a linear time algorithm to color the graphs in the subclass by 3 colors.