Abstract
We study the computational complexity of the vertex 3-colorability problem in the class of claw-free graphs. Both the problem and the class received much attention in the literature, separately of each other. However, very little is known about the 3-colorability problem restricted to the class of claw-free graphs beyond the fact the problem is NP-complete under this restriction. In this paper we first strengthen this negative fact by revealing various further restrictions under which the problem remains NP-complete. Then we derive a number of positive results that deal with polynomially solvable cases of the problem in the class of claw-free graphs.
Similar content being viewed by others
References
Bodlaender HL, Thilikos DM (1997) Treewidth for graphs with small chordality. Discret Appl Math 79:45–61
Chudnovsky M, Seymour P (2005) The structure of claw-free graphs. Surveys in combinatorics. London Mathematical Society Lecture Note Series 327:153–171
Courcelle B, Makowsky JA, Rotics U (2000) Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput Syst 33:125–150
Favaron O (2003) Independence and upper irredundance in claw-free graphs. Discret Appl Math 132:85–95
Harary F (1969) Graph theory. Addison-Wesley, Reading
Holyer Ian (1981) The NP-completness of edge-coloring. SIAM J Comput 10:718–720
Kaminski M, Lozin VV (2007a) Coloring edges and vertices of graphs without short or long cycles. Contributions Discret Math 2:61–66
Kaminski M, Lozin VV (2007b) Vertex 3-colorability of claw-free graphs. Algorithmic Oper Res 2:15–21
Kochol M (2005) 3-coloring and 3-clique-ordering of locally connected graphs. J Algorithms 54:122–125
Kochol M, Lozin V, Randerath B (2003) The 3-colorability problem on graphs with maximum degree 4. SIAM J Comput 32:1128–1139
Li X, Zang W (2005) A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs. J Comb Optim 9:331–347
Lozin V, Rautenbach D (2004) On the band-, tree- and clique-width of graphs with bounded vertex degree. SIAM J Discret Math 18:195–206
Maffray F, Preissmann M (1996) On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs. Discret Math 162:313–317
Randerath B (2004) 3-colorability and forbidden subgraphs. I. Characterizing pairs. Discret Math 276:313–325
Randerath B, Schiermeyer I (2004a) 3-colorability \(\in {\bf P}\) for \(P_6\)-free graphs. Discret Appl Math 136:299–313
Randerath B, Schiermeyer I (2004b) Vertex colouring and forbidden subgraphs—a survey. Graphs Comb 20:1–40
Randerath B, Schiermeyer I, Tewes M (2002) Three-colorability and forbidden subgraphs. II: polynomial algorithms. Discret Math 251:137–153
Acknowledgments
Support of DIMAP—the Centre of Discrete Mathematics and its Applications at the University of Warwick—is gratefully acknowledged. Research of Vadim Lozin was supported by EPSRC, Grant EP/I01795X/1.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lozin, V., Purcell, C. Coloring vertices of claw-free graphs in three colors. J Comb Optim 28, 462–479 (2014). https://doi.org/10.1007/s10878-012-9577-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9577-5