On the L(2, 1)-labelling of block graphs

International Journal of Computer Mathematics

Volumn 88, Issue 3, 2011, Pages 468-475

  Bonomo, Flavia ^a   Cerioli, Marcia R ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

block graphs; distance two labelling problem; graph colouring

Indexed keywords

EID: 79251513305     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207161003650075     Document Type: Article

References (12)

1. G. Chang and D. Kuo, The L(2, 1)-labeling on graphs, SIAM J. Discrete Math. 9 (1996), pp. 309-316.
2. G. Chang and C. Lu, Distance-two labeling of graphs, Eur. J. Combin. 24 (2003), pp. 53-58.
3. G. Chang, W.T. Ke, D. Kuo, D.F. Lin, and R. Yeh, On L(d, 1)-labelings of graphs, Discrete Math. 220 (2000), pp. 57-66.
4. P. Fishburn and F. Roberts, Full color theorems for L(2, 1)-colorings,SIAMJ. Discrete Math. 20 (2006), pp. 428-443.
5. J. Georges and D. Mauro, On regular graphs optimally labeled with a condition at distance two, SIAM J. Discrete Math. 17 (2003), pp. 320-331.
6. D. Gonçalves, On the L(p, 1)-labelling of graphs, Discrete Math. 308 (2008), pp. 1405-1414.
7. J. Griggs and R.Yeh, Labeling graphs with a condition at distance two,SIAMJ. Discrete Math. 5 (1992), pp. 586-595.
8. W. Hale, Frequency Assignment: Theory and Applications, Proc. IEEE 68(12) (1980), pp. 1497-1514.
9. F. Havet, B. Reed, and J.S. Sereni, L(2, 1)-labelling of graphs, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January, 2008, pp. 621-630.
10. D. Král and R. Škrekovski, A theorem about the channel assignment problem, SIAM J. Discrete Math. 16 (2003), pp. 426-437.
11. D. Kuo and J. Yan, On L(2, 1)-labelings of Cartesian products of paths and cycles, Discrete Math. 283 (2004), pp. 137-144.
12. D.F. Liu and R.Yeh, On distance-two labelings of graphs, Ars Combinatoria 47 (1997), pp. 13-22.