Radio k-colorings of paths
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 5-21
Voir la notice de l'article provenant de la source Library of Science
For a connected graph G of diameter d and an integer k with 1 ≤ k ≤ d, a radio k-coloring of G is an assignment c of colors (positive integers) to the vertices of G such that
Keywords:
radio k-coloring, radio k-chromatic number
@article{DMGT_2004_24_1_a0,
author = {Chartrand, Gary and Nebesk\'y, Ladislav and Zhang, Ping},
title = {Radio k-colorings of paths},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {5--21},
publisher = {mathdoc},
volume = {24},
number = {1},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a0/}
}
Chartrand, Gary; Nebeský, Ladislav; Zhang, Ping. Radio k-colorings of paths. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 5-21. http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a0/