Jump to content

L(2,1)-coloring

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BG19bot (talk | contribs) at 06:13, 26 August 2015 (WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (11377)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An L(2,1)-coloring of C6

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]

References

  1. ^ Chartrand, Gary; Zhang, Ping (2009). "14. Colorings, Distance, and Domination". Chromatic Graph Theory. CRC Press. pp. 397–438.
Retrieved from "https://en.wikipedia.org/w/index.php?title=L(2,1)-coloring&oldid=677899511"