The L (2, 1)-labeling on planar graphs

Applied Mathematics Letters

Volumn 20, Issue 2, 2007, Pages 222-226

  Shao, Zhendong ^a   Yeh, Roger K ^b  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Channel assignment; Distance two graph labeling

Indexed keywords

FUNCTIONS; INTEGER PROGRAMMING; NUMBER THEORY;

CHANNEL ASSIGNMENT; DISTANCE TWO GRAPH LABELING;

GRAPH THEORY;

EID: 33750046625     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2006.02.033     Document Type: Article

References (18)

1. Beineke L.W., and Wilson R.J. Selected Topics in Graph Theory (1978), Academic Press
2. Bodlaender H.L., Kloks T., Tan R.B., and Leeuwen J.v. λ-coloring of graphs. Lecture Notes in Computer Science vol. 1770 (2000), Springer-Verlag Berlin, Heidelberg 395-406
3. Chang G.J., Ke W.-T., Kuo D., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labelings of graphs. Discrete Math. 220 (2000) 57-66
4. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 2 (1996) 309-316
5. Fiala J., Kloks T., and Kratochvíl J. Fixed-parameter complex of λ-labelings. Lecture Notes in Computer Science vol. 1665 (1999), Springer-Verlag Berlin, Heidelberg 350-363
6. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
7. van den Heuvel J., and McGuinness S. Coloring the square of a planar graph. J. Graph Theory 42 (2003) 110-124
8. Jha P.K., Narayanan K., Sood P., Sundaram K., and Sunder V. On L (2, 1)-labeling of the Cartesian product of a cycle and a path. Ars. Combin. 55 (2000) 81-89
9. K. Jonas, Graph colorings analogues with a condition at distance two: L (2, 1)-labelings and list λ-labelings, Ph.D. Thesis, Dept. of Math., Univ. of South Carolina, Columbia, SC, USA, 1993
10. Král D., and S ̌krekovski R. A theorem about the channel assignment problem. SIAM J. Discrete Math. 16 (2003) 426-437
11. Kuo D., and Yan J.-H. On L(2,1)-labeling of Cartesian products of paths and cycles. Discrete Math. 283 1-3 (2004) 137-144
12. Liu D.D.-F., and Yeh R.K. On distance-two labelings of graphs. Ars Combin. 47 (1997) 13-22
13. M. Molloy, M.R. Salavatipour, A bound on the chromatic number of the square of a planar graph, preprint
14. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
15. Shao Z., and Yeh R.K. The L (2, 1)-labeling and operations of graphs. IEEE Trans. Circuits & Systems I: Regular Papers 52 (2005) 668-671
16. Wang W., and Lih K.-W. Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17 (2003) 264-275
17. E.W. Weisstein, Euler Characteristic, From MathWorld-A Wolfram Web Resource. http://mathworld.wolfram.com/EulerCharacteristic.html
18. West D.B. Introduction to Graph Theory. 2nd edition (2001), Prentice Hall, NJ