For positive integers $k$ and $r$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at least $\min\{r,d(v)\}$ different colors. The smallest integer $k$ for which a graph $G$ has a conditional $(k,r)$-coloring is called the $r$th-order conditional chromatic number, and is denoted by $X_r(G)$. It is easy to see that conditional coloring is a generalization of traditional vertex coloring (the case $r=1$). In this work, we consider the complexity of the conditional colorability of graphs. Our main result is that conditional (3,2)-colorability remains NP-complete when restricted to planar bipartite graphs with maximum degree at most 3 and arbitrarily high girth. This differs considerably from the well-known result that traditional 3-colorability is polynomially solvable for graphs with maximum degree at most 3. On the other hand we show that (3,2)-colorability is polynomially solvable for graphs with bounded tree-width. We also prove that some other well-known complexity results for traditional coloring still hold for conditional coloring.
[1]
Hong-Jian Lai,et al.
Conditional colorings of graphs
,
2006,
Discret. Math..
[2]
Paul S. Bonsma,et al.
The complexity of the matching‐cut problem for planar graphs and other graph classes
,
2003,
J. Graph Theory.
[3]
David S. Johnson,et al.
Some Simplified NP-Complete Graph Problems
,
1976,
Theor. Comput. Sci..
[4]
R. Möhring.
Algorithmic graph theory and perfect graphs
,
1986
.
[5]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[6]
Elwood S. Buffa,et al.
Graph Theory with Applications
,
1977
.
[7]
Hong-Jian Lai,et al.
Upper Bounds of Dynamic Chromatic Number
,
2003,
Ars Comb..
[8]
Bruce Montgomery.
Dynamic coloring of graphs
,
2002
.
[9]
Bruno Courcelle,et al.
The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs
,
1990,
Inf. Comput..
[10]
J. A. Bondy,et al.
Graph Theory with Applications
,
1978
.