Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time

Let 2P"3 denote the disjoint union of two paths on three vertices. A graph G that has no subgraph isomorphic to a graph H is called H-free. The Vertex Coloring problem is the problem to determine the chromatic number of a graph. Its computational complexity for triangle-free H-free graphs has been classified for every fixed graph H on at most 6 vertices except for the case H=2P"3. This remaining case is posed as an open problem by Dabrowski, Lozin, Raman and Ries. We solve their open problem by showing polynomial-time solvability.

[1]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[2]  Zsolt Tuza,et al.  Complexity of Coloring Graphs without Forbidden Induced Subgraphs , 2001, WG.

[3]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[4]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Rajiv Raman,et al.  Colouring Vertices of Triangle-Free Graphs , 2010, WG.

[7]  Gerhard J. Woeginger,et al.  The complexity of coloring graphs without long induced paths , 2001, Acta Cybern..

[8]  Keith Edwards,et al.  The Complexity of Colouring Problems on Dense Graphs , 1986, Theor. Comput. Sci..

[9]  Van Bang Le,et al.  On the complexity of 4-coloring graphs without long induced paths , 2007, Theor. Comput. Sci..

[10]  J. K. Il.  Precoloring Extension with Fixed Color Bound , 1994 .

[11]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[12]  Egon Balas,et al.  On graphs with polynomially solvable maximum-weight clique problem , 1989, Networks.

[13]  Jan Kratochvíl,et al.  Precoloring extension with fixed color bound. , 1993 .

[14]  Ingo Schiermeyer,et al.  3-Colorability in P for P6-free graphs , 2004, Discret. Appl. Math..

[15]  Myriam Preissmann,et al.  On the NP-completeness of the k-colorability problem for triangle-free graphs , 1996, Discret. Math..

[16]  Vadim V. Lozin,et al.  The Clique-Width of Bipartite Graphs in Monogenic Classes , 2008, Int. J. Found. Comput. Sci..

[17]  Joe Sawada,et al.  A Certifying Algorithm for 3-Colorability of P5-Free Graphs , 2009, ISAAC.

[18]  Wojciech Rytter,et al.  International Workshop on Combinatorial Algorithms (IWOCA) , 2007 .

[19]  Vadim V. Lozin,et al.  Deciding k-Colorability of P5-Free Graphs in Polynomial Time , 2007, Algorithmica.

[20]  Stephan Brandt,et al.  Triangle-free graphs and forbidden subgraphs , 2002, Discret. Appl. Math..

[21]  Vadim V. Lozin,et al.  Coloring edges and vertices of graphs without short or long cycles , 2007, Contributions Discret. Math..

[22]  Jian Song,et al.  Updating the complexity status of coloring graphs without a fixed induced linear forest , 2012, Theor. Comput. Sci..

[23]  Martin Kochol,et al.  The 3-Colorability Problem on Graphs with Maximum Degree Four , 2003, SIAM J. Comput..

[24]  Vadim V. Lozin,et al.  Independent sets in extensions of 2K2-free graphs , 2005, Discret. Appl. Math..

[25]  Petr A. Golovach,et al.  Three complexity results on coloring Pk-free graphs , 2009, Eur. J. Comb..

[26]  Ingo Schiermeyer,et al.  Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..

[27]  Vadim V. Lozin,et al.  Vertex 3-colorability of Claw-free Graphs , 2007, Algorithmic Oper. Res..