Distance constrained labelings of K4-minor free graphs

Discrete Mathematics

Volumn 309, Issue 18, 2009, Pages 5745-5756

  Král', Daniel ^a   Nejedlý, Pavel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Distance constrained labeling; K4 minor free graph; Series parallel graph

Indexed keywords

DISTANCE CONSTRAINED LABELING; FREE GRAPHS; K4-MINOR FREE GRAPH; L(P , Q)-LABELING; LABELINGS; MAXIMUM DEGREE; SERIES-PARALLEL GRAPH;

LABELS;

GRAPH THEORY;

EID: 69549118749     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.05.022     Document Type: Article

References (31)

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. Bella P., Král' D., Mohar B., and Quittnerová K. Labeling planar graphs with a condition at distance two. European J. Combin. 28 8 (2007) 2201-2239
5. 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
6. 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
7. 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
8. Calamoneri T., and Petreschi R. L (2, 1)-labeling of planar graphs. Proc. ALM'01 (2001), ACM press 28-33
9. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 2 (1996) 309-316
10. Z. Dvořák, D. Král', P. Nejedlý, R. Škrekovski, Coloring squares of planar graphs with no short cycles, Discrete Appl. Math. (special issue) (in press). A preliminary version available as ITI series 2005-243 (submitted for publication)
11. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 1 (2001) 59-72
12. 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
13. Gonçalves D. On the L (p, 1)-labelling of graphs. Discrete Math. Theor. Comput. Sci. AE (2005) 81-86
14. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
15. Havet F., Reed B., and Sereni J.-S. L (2, 1)-labelling of graphs. Proc. SODA'08 (2008), SIAM Press 621-630
16. van den Heuvel J., and McGuiness S. Colouring of the square of a planar graph. J. Graph Theory 42 (2003) 110-124
17. J.-H. Kang, L (2, 1)-labeling of 3-regular Hamiltonian graphs (submitted for publication)
18. J.-H. Kang, L (2, 1)-labelling of 3-regular Hamiltonian graphs, Ph.D. Thesis, University of Illinois, Urbana-Champaign, IL, 2004
19. 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
20. Král' D. An exact algorithm for channel assignment problem. Discrete Appl. Math. 145 2 (2004) 326-331
21. Král' D., and Škrekovski R. A theorem about channel assignment problem. SIAM J. Discrete Math. 16 3 (2003) 426-437
22. Král' D. Coloring powers of chordal graphs. SIAM J. Discrete Math. 18 3 (2004) 451-461
23. 4-minor free graph. Discrete Math. 269 (2003) 303-309
24. McDiarmid C. On the span in channel assignment problems: Bounds, computing and counting. Discrete Math. 266 (2003) 387-397
25. 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
26. 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
27. Sakai D. Labeling chordal graphs: Distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140
28. C. Thomassen, manuscript, 2006 (unpublished)
29. 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
30. 4-minor free graphs. Inform. Process. Lett. 98 (2006) 169-173
31. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, Germany, 1977