L(2,1)-labelling of graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 621-630

  Havet, Frédéric ^a   Reed, Bruce ^a,b   Sereni, Jean Sébastien ^c  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b MCGILL UNIVERSITY   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM (WEIGHTED) DEGREE; POSITIVE INTEGERS;

EID: 49049105911     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. T. Calamoneri. The L(h, k)-Labeling Problem: A Survey, (2004). Available from: http://www.dsi.uniroma1.it/~calamo/survey.html
2. G. J. Chang and D. Kuo, The L(2,1)-labeling problem on graphs, SIAM J. Discr. Math., 9 (1996), pp. 309-316.
3. J. P. Georges, D. W. Mauro and M. A. Whittlesey, Relating path coverings to vertex labelings with a condition at distance two, Discrete Math., 135 (1994), pp. 103-111.
4. D. Gonçalves, On the L(p,l)-labelling of graphs, Discrete Math., to appear.
5. J. R. Griggs and D. Krái', Graph labellings with variable weights, a survey, Submitted.
6. J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discr. Math., 11 (1992), pp. 585-595.
7. T. K. Jonas, Graph coloring analogues with a condition at distance two: L(2,1)-labelings and list λTabelings, Ph.D. Thesis, University of South Carolina, 1993.
8. D. Král' and R. Škrekovski, A theorem about the channel assignment, SIAM J. Discr. Math., 16 (2003), pp. 426-437.
9. M. Molloy and B. Reed, Graph colouring and the probabilistic method. Algorithms and Combinatorics, 23. Springer-Verlag, Berlin, 2002.
10. F. Havet, B. Reed and J.-S. Sereni, L(2,1)- labelling of graphs, ITI-Series. Available from: http://kam.mff.cuni.cz/~sereni/
11. R. K. Yeh, A survey on labeling graphs with acondition at distance two, Discrete Math., 306 (2006), no. 12, 1217-1231.