IJPAM: Volume 87, No. 6 (2013)
Department of Mathematics
Chennai 600 034, INDIA
Abstract. The packing chromatic number of a graph is the smallest integer for which there exists a mapping such that any two vertices of color are at distance at least . It is a frequency assignment problem used in wireless networks, which is also called broadcasting coloring. It is proved that packing coloring is NP-complete for general graphs and even for trees. In this paper, we study the packing chromatic number of comb graph, circular ladder, windmill, H-graph and uniform theta graph.
Received: September 6, 2013
AMS Subject Classification: 05C15
Key Words and Phrases: packing chromatic number, comb graph, circular ladder, windmill, -graph, uniform theta graph
Download paper from here.
DOI: 10.12732/ijpam.v87i6.1 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395