List-coloring squares of sparse subcubic graphs

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 1, 2008, Pages 139-159

  Dvořák, Zdeněk ^a   Škrekovski, Riste ^b   Tancer, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Complexity; List coloring; NP complete; Planar graphs; Sparse graphs; Square of a graph

Indexed keywords

CONTROL THEORY;

COMPLEXITY; LIST COLORING; NP-COMPLETE; PLANAR GRAPHS; SPARSE GRAPHS; SQUARE OF A GRAPH;

COLORING;

EID: 61849155217     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050634049     Document Type: Article

References (17)

1. O. V. BORODIN, Criterion of chromaticity of a degree prescription, in Abstracts of the Fourth All-Union Conference on Theoretical Cybernetics, Novosibirsk, 1997, pp. 127-128.
2. O. V. BORODIN, A. N. GLEBOV, A. O. IVANOVA, T. K. NEUSTROEVA, AND V. A. TASHKINOV, A sufficient condition for a planar graph to be 2-distant (Δ + 1)-colorable. Sib. Elektron. Math. Izv., 1 (2004), pp. 129-141 (in Russian).
3. T. CALAMONERI, The L(h, k)-Labelling Problem: a Survey, Technical report 04/2004, Department of Computer Sciences, University of Rome "La Sapienza," Rome, Italy, 2004.
4. D. P. DAILEY, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Math., 30 (1980), pp. 289-293.
5. Z. DVOŘÁK, D. KRÁL', P. NEJEDLÝ, AND R. ŠKREKOVSKI, Coloring squares of planar graphs with no short cycles, submitted.
6. P. ERDOS, A. L. RUBIN, AND H. TAYLOR, Choosability in graphs, in Proceedings of the West Coast Conference on Combinatorics, Graph Theory, and Computing (Humboldt State University, Arcata, CA, 1979), Congress. Numer. XXVI, Utilitas Math., Winnipeg, 1980, pp. 125-157.
7. P. HEGGERNES AND J. A. TELLE, Partitioning graphs into generalized dominating sets, Nordic J. Comput., 5 (1998), pp. 128-143.
8. J. VAN DEN HEUVEL AND S. MCGUINESS, Colouring of the square of a planar graph, J. Graph Theory, 42 (2003), pp. 110-124.
9. T. R. JENSEN AND B. TOFT, Graph Coloring Problems, John Wiley and Sons, New York, 1995.
10. D. KRÁL', T. MADARAS, AND R. ŠKREKOVSKI, Cyclic, diagonal, and facial colorings, European J. Combin., 26 (2005), pp. 473-490.
11. K.-W. LIH AND W.-F. WANG, Coloring the Square of an Outerplanar Graph, Technical report, Academia Sinica, Taiwan, 2002.
12. M. MOLLOY AND M. R. SALAVATIPOUR, A bound on the chromatic number of the square of a planar graph, J. Combin. Theory Ser. B, 94 (2005), pp. 89-213.
13. M. MOLLOY AND M. R. SALAVATIPOUR, Frequency channel assignment on planar networks, in Algorithms - ESA 2002, R. H. Möhring and R. Raman, eds., Lecture Notes in Comput. Sci. 2461, Springer, Berlin, 2002, pp. 736-747.
14. M. MONTASSIER AN A. RASPAUD, A Note on 2-Facial Coloring of Plane Graphs, Technical report RR-1341-05, LaBRI, Bordeaux, France, 2005.
15. S. RAMANATHAN, Scheduling Algorithms for Multi-Hop Radio Networks, Ph.D. thesis, Department of Computer Science, University of Delaware, Newark, 1993.
16. G. WEGNER, Graphs with Given Diameter and a Coloring Problem, Technical report, University of Dortmund, Dortmund, Germany, 1977.
17. X. ZHOU, Y. KANARI, AND T. NISHIZEKI, Generalized vertex-coloring of partial k-trees, IEICE Trans. Fund. Electron. Commun. Comput. Sci., E83-A (2000), pp. 671-678.