Affiliation:
1. Northwest University for Nationalities
Abstract
A-distance coloringof is said to be adjacent vertex distinguishing if this coloring satisfy for any pair of adjacent vertices and in, wheredenotes the set of colors that are received by the vertex and all neighbors of with respect to. The minimum number of colors necessary to adjacent vertex distinguishing-distance color, is denoted by. In this paper, we give the exact values of forand, where denotes the-dimensional grid.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. G. Fertin, E. Godard and A. Raspaud : Acyclic and k-distance coloring of the grid. Information Processing Letters, 87, 51-58 (2003).
2. J. P. Georges and D. M. Mauro: Generalized vertex labelings with a condition at distance two, Congr. Numer., 109, 141-159 (1995).
3. J. R. Griggs and R. K. Yeh: Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5, 586-595(1992).
4. J. Heuvel and S. McGuinness: Coloring the square of a planar graph, J. Graph Theory, 42, 110-124 (2003).
5. S. Jendrol and Z. Skupień: Local structures in plane maps and distance colorings, Discrete Math., 236, 167-177 (2001).