Some results on distance two labelling of outerplanar graphs

Acta Mathematicae Applicatae Sinica

Volumn 25, Issue 1, 2009, Pages 21-32

  Wang, Wei Fan ^a   Luo, Xiao Fang ^b  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

^b YIWU INDUSTRIAL AND COMMERCIAL COLLEGE   (China)

Author keywords

Chromatic number; L(2, 1) labelling; Outerplanar graph

Indexed keywords

EID: 58149271068     PISSN: 01689673     EISSN: 16183932     Source Type: Journal    
DOI: 10.1007/s10255-006-6065-7     Document Type: Article

References (19)

1. Bodlaender, H.L., Kloks, T., Tan, R.B., Leeuwen, J. Approximations for λ-coloring of graphs. in: H. Reichel and S. Tison (Eds.), STACS 2000, Proc. 17th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science Vol. 1770, Springer-Verlag, Berlin, 2000, pp. 395-406
2. T. Calamoneri R. Petreschi 2003 L(h, 1)-labeling subclasses of planar graphs J. Parallel Distrib. Comput. 64 414 426
3. G.J. Chang D. Kuo 1996 The L(2, 1)-labelling problem on graphs SIAM J. Discrete Math. 9 309 316
4. G.J. Chang W.T. Ke D. Kuo D. D.F. Liu R.K. Yeh 2000 On L(d, 1)-labelling of graphs Discrete Math. 220 57 66
5. J.P. Georges D.W. Mauro M.I. Stein 2000 Labeling products of complete graphs with a condition at distance two SIAM J. Discrete Math. 14 28 35
6. J.R. Griggs R.K. Yeh 1992 Labelling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 586 595
7. W.K. Hale 1980 Frequency assignment: theory and applications Proc. IEEE. 68 1497 1514
8. J. van den Heuvel S. [tmp] McGuinness 2003 Coloring the square of a planar graph J. Graph Theory 42 110 124
9. D. Král R. Škrekovski 2003 A theorem about the channel assignment problem SIAM J. Discrete Math. 16 426 437
10. D. D.F. Liu X. Zhu 2006 Circular distance two labeling and the λ-number for outerplanar graphs SIAM J. Discrete Math. 19 281 293
11. 4-minor free graph Discrete Math. 269 303 309
12. M. Molloy M.R. Salavatipour 2005 A bound on the chromatic number of the square of a planar graph J. Combin. Theory Ser. B 94 189 213
13. D. Sakai 1994 Labelling chordal graphs: distance two condition SIAM J. Discrete Math. 7 133 140
14. W. Wang K.W. Lih 2001 Choosability, edge-choosability and total choosablity of outerplane graphs European J. Combin. 22 71 78
15. W. Wang K. W. Lih 2004 Labelling planar graphs with conditions on girth and distance two SIAM J. Discrete Math. 17 264 275
16. W. Wang 2006 The L(2, 1)-labelling of trees Discrete Applied Math. 154 598 603
17. W. Wang K.W. Lih 2008 Note on coloring the square of an outerplanar graph Ars Combin. 86 89 95
18. Wegner, G. Graphs with given diameter and a coloring problem. Preprint, University of Dortmund, 1977
19. n and related graphs SIAM J. Discrete Math. 8 499 506