Geodesic
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/}
}
TY  - JOUR
AU  - Chartrand, Gary
AU  - Nebeský, Ladislav
AU  - Zhang, Ping
TI  - Radio k-colorings of paths
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 5
EP  - 21
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a0/
LA  - en
ID  - DMGT_2004_24_1_a0
ER  - 
%0 Journal Article
%A Chartrand, Gary
%A Nebeský, Ladislav
%A Zhang, Ping
%T Radio k-colorings of paths
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 5-21
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a0/
%G en
%F 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/

[1] G. Chartrand, D. Erwin, F. Harary and P. Zhang, Radio labelings of graphs, Bull. Inst. Combin. Appl. 33 (2001) 77-85.

[2] G. Chartrand, D. Erwin and P. Zhang, A graph labeling problem suggested by FM channel restrictions, Bull. Inst. Combin. Appl. (accepted).

[3] G. Chartrand, D. Erwin and P. Zhang, Radio antipodal colorings of cycles, Congr. Numer. 144 (2000) 129-141.

[4] G. Chartrand, D. Erwin and P. Zhang, Radio antipodal colorings of graphs, Math. Bohem. 127 (2002) 57-69.

[5] D. Fotakis, G. Pantziou, G. Pentaris and P. Sprirakis, Frequency assignment in mobile and radio networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45 (1999) 73-90.

[6] W. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1980, doi: 10.1109/PROC.1980.11899.

[7] J. van den Heuvel, R.A. Leese and M.A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory 29 (1998) 263-283, doi: 10.1002/(SICI)1097-0118(199812)29:4263::AID-JGT5>3.0.CO;2-V

[8] Minimum distance separation between stations, Code of Federal Regulations, Title 47, sec. 73.207.