L(2,1)-coloring
L(2, 1)-coloring is a particular case of L(h, k)-coloring which is in fact a proper coloring. In L(2, 1)-coloring of a graph, G, the vertices of the graph G is colored or labelled in such a way that the adjacent vertices get labels that differ by at least two. Also the vertices that are at a distance of two from each other get labels that differ by at least one.[1]
-coloring_of_C6.png)
An L(2,1)-coloring of C6
References
- Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. pp. 397–438.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.