Coloring powers of chordal graphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 3, 2004, Pages 451-461

  Král, Daniel ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Chordal graphs; Graph coloring; Graph powers; L(p, q) labeling

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; NUMBER THEORY; NUMERICAL ANALYSIS;

CHORDAL GRAPHS; GRAPH COLORING; GRAPH POWERS; L(P, Q)-LABELING;

GRAPH THEORY;

EID: 23844454927     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103424079     Document Type: Article

References (15)

1. G. AGNARSSON, R. GREENLAW, AND M. M. HALLDÓRSSON, On Powers of chordal graphs and their coloring, Congr. Numer., 144 (2000), pp. 41-65.
2. G. AGNARSSON AND M. M. HALLDÓRSSON, Coloring powers of planar graphs, SIAM J. Discrete Math., 16 (2003), pp. 651-662.
3. N. ALON AND B. MOHAR, The chromatic number of graph powers, Combin. Probab. Comput., 11 (2002), pp. 1-10.
4. H. L. BODLAENDER, T. KLOKS, R. B. TAN, AND J. VAN LEEUWEN, λ-coloring of graphs, in Proceedings of the STACS'00, Lecture Notes in Comput. Sci. 1770, G. Goos, J. Hartmanis, and J. van Leeuwen, eds., Springer-Verlag, Berlin, 2000, pp. 395-406.
5. A. BRANDSTÄDT, Special Graph Classes - A Survey, Schriften-Mathematik Uni.-Duisburg, Duisburg, Germany, 1991.
6. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
7. G. J. CHANG, W.-T. KE, D. D.-F. LIU, AND R. K. YEH, On L(d, 1)-labellings of graphs, Discrete Math., 220 (2000), pp. 57-66.
8. J. FIALA, J. KRATOCHVÍL, AND T. KLOKS, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math., 113 (2001), pp. 59-72.
9. D. A. FOTAKIS, S. E. NIKOLETSEAS, V. G. PAPADOPOULOU, AND P. G. SPIRAKIS, NP-completeness results and efficient approximations for radiocoloring in planar graphs, in Proceedings of the MFCS'00, Lecture Notes in Comput. Sci. 1893, B. Rovan, ed., Springer-Verlag, New York, 2000, pp. 363-372.
10. J. R. GILBERT, D. J. ROSE, AND A. EDENBRANDT, A separator theorem for chordal graphs, SIAM J. Algebraic Discrete Methods, 5 (1984), pp. 306-313.
11. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
12. H. IWANIEC AND J. PINTZ, Primes in short intervals, Monatsh. Math., 98 (1984), pp. 115-143.
13. D. KRÁL' AND R. ŠKREKOVSKI, A theorem about the channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
14. C. McDIARMID, Discrete mathematics and radio channel assignment, in Recent Advances in Algorithms and Combinatorics, C. Linhares-Salas and B. Reed, eds., Springer, New York, 2003, pp. 27-63.
15. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.