Labeling planar graphs with a condition at distance two

European Journal of Combinatorics

Volumn 28, Issue 8, 2007, Pages 2201-2239

  Bella, Peter ^a   Král', Daniel ^a   Mohar, Bojan ^b,c   Quittnerová, Katarína ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048875390     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.04.019     Document Type: Article

References (26)

1. G. Agnarsson, R. Greenlaw, M.M. Halldórsson, Powers of chordal graphs and their coloring, Congr. Numer. (in press)
2. Agnarsson G., and Halldórsson M.M. Coloring powers of planar graphs. Proc. SODA'00 (2000), SIAM Press 654-662
3. Agnarsson G., and Halldórsson M.M. Coloring powers of planar graphs. SIAM J. Discrete Math. 16 4 (2003) 651-662
4. Bodlaender H.L., Kloks T., Tan R.B., and van Leeuwen J. λ-coloring of graphs. In: Goos G., Hartmanis J., and van Leeuwen J. (Eds). Proc. STACS'00. LNCS vol. 1770 (2000), Springer 395-406
5. O. Borodin, H.J. Broersma, A. Glebov, J. van den Heuvel, Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM Research Report 2002-05, 2002
6. Chang G.J., Ke W.-T., Liu D.D.-F., and Yeh R.K. On L (d, 1)-labellings of graphs. Discrete Math. 3 1 (2000) 57-66
7. Calamoneri T., and Petreschi R. L (2, 1)-labeling of planar graphs. Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ALM'01 (2001), ACM press 28-33
8. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 2 (1996) 309-316
9. Z. Dvořák, D. Král', P. Nejedlý, R. Škrekovski, Coloring squares of planar graphs with no short cycles (submitted for publication). A preliminary version available as ITI series 2005-243
10. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 1 (2001) 59-72
11. Fotakis D.A., Nikoletseas S.E., Papadopoulou V.G., and Spirakis P.G. NP-Completeness results and efficient approximations for radiocoloring in planar graphs. In: Rovan B. (Ed). Proc. MFCS'00. LNCS vol. 1893 (2000), Springer 363-372
12. Gonçalves D. On the L (p, 1)-labelling of graphs. Discrete Math. Theor. Comput. Sci. AE (2005) 81-86
13. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
14. Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
15. van den Heuvel J., and McGuiness S. Colouring of the square of a planar graph. J. Graph Theory 42 (2003) 110-124
16. J.-H. Kang, L (2, 1)-labeling of 3-regular Hamiltonian graphs (submitted for publication)
17. J.-H. Kang, L (2, 1)-labelling of 3-regular Hamiltonian graphs, Ph.D. Thesis, University of Illinois, Urbana-Champaign, IL, 2004
18. 2-conjecture for L (2, 1)-labelings is true for direct and strong products of graphs. IEEE Trans. Circuits Syst. II 53 4 (2006) 274-277
19. Král' D. An exact algorithm for channel assignment problem. Discrete Appl. Math. 145 2 (2004) 326-331
20. Král' D., and Škrekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
21. Král' D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18 3 (2004) 451-461
22. McDiarmid C. On the span in channel assignment problems: Bounds, computing and counting. Discrete Math. 266 (2003) 387-397
23. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B. 94 (2005) 189-213
24. Molloy M., and Salavatipour M.R. Frequency channel assignment on planar networks. In: Möhring R.H., and Raman R. (Eds). Proc. ESA'02. LNCS vol. 2461 (2002), Springer 736-747
25. Sakai D. Labeling chordal graphs: Distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140
26. Wang W.-F., and Lih K.-W. Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17 2 (2003) 264-275