L(h, k)-coloring

L(h, k) coloring in graph theory, is a (proper) vertex coloring in which every pair of adjacent vertices has color numbers that differ by at least h, and any pair of vertices at distance 2 have their colors differ by at least k.[1] When h=1 and k=0, it is the usual (proper) vertex coloring.

References

  1. ↑ Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. pp. 397–438.
This article is issued from Wikipedia - version of the Wednesday, September 09, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.