Conditional colorings of graphs (Q2501581): Difference between revisions

For an integer \(r>0\), a conditional \((k,r)\)-coloring of a graph \(G\) is a proper \(k\)-coloring of the vertices of \(G\) such that every vertex of degree at least \(r\) in \(G\) is adjacent to vertices with at least \(r\) different colors. The smallest integer \(k\) for which a graph \(G\) has a conditional \((k,r)\)-coloring is the \(r\)th order conditional chromatic number. In this paper, the behavior and bounds of the conditional chromatic number of a graph \(G\) are investigated.