Radio coloring

Radio coloring in graph theory, is a (proper) vertex coloring in which every pair of adjacent vertices has color numbers that differ by at least two, and any pair of nodes at distance 2 have different colors.[1]The term radio coloring was coined by Frank Harary. [2]

References

  1. ↑ Chartrand, Gary; Erwin, David; Harary, Frank; Zhang, Ping (2001), "Radio Labelings of Graphs", Bull. Inst. Combin. Appl. 33: 77–85.
  2. ↑ 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.