L(2,1)-coloring
From HandWiki
-coloring_of_C6.svg)
L(2, 1)-coloring is a particular case of L(h, k)-coloring. In an L(2, 1)-coloring of a graph, G, the vertices of G are assigned color numbers in such a way that adjacent vertices get labels that differ by at least two, and the vertices that are at a distance of two from each other get labels that differ by at least one.[1]
An L(2,1)-coloring is a proper coloring, since adjacent vertices are assigned distinct colors.
References
- ↑ Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. pp. 397–438.
 |  |
