Vertex coloring of graphs with few obstructions

We study the vertex coloring problem in classes of graphs defined by finitely many forbidden induced subgraphs. Of our special interest are the classes defined by forbidden induced subgraphs with at most 4 vertices. For all but three classes in this family we show either NP-completeness or polynomial-time solvability of the problem. For the remaining three classes we prove fixed-parameter tractability. Moreover, for two of them we give a 3/2 approximation polynomial algorithm.

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

[2]  Bruce A. Reed,et al.  beta-Perfect Graphs , 1996, J. Comb. Theory, Ser. B.

[3]  Jian Song,et al.  Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time , 2012, Theor. Comput. Sci..

[4]  Vadim V. Lozin,et al.  NP-hard graph problems and boundary classes of graphs , 2007, Theor. Comput. Sci..

[5]  Joost Engelfriet,et al.  Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.

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

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

[8]  Zsolt Tuza,et al.  Graphs with no induced C4 and 2K2 , 1993, Discret. Math..

[9]  Martin Farber,et al.  On diameters and radii of bridged graphs , 1989, Discret. Math..

[10]  V. E. Alekseev,et al.  On easy and hard hereditary classes of graphs with respect to the independent set problem , 2003, Discret. Appl. Math..

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

[12]  Eyal Amir,et al.  Approximation Algorithms for Treewidth , 2010, Algorithmica.

[13]  Stanley Wagon,et al.  A bound on the chromatic number of graphs without certain induced subgraphs , 1980, J. Comb. Theory, Ser. B.

[14]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[15]  The Band , 1921 .

[16]  Vadim V. Lozin,et al.  Boundary properties of graphs for algorithmic graph problems , 2011, Theor. Comput. Sci..

[17]  S. E. Markosyan,et al.  ω-Perfect graphs , 1990 .

[18]  Michaël Rao,et al.  MSOL partitioning problems on graphs of bounded treewidth and clique-width , 2007, Theor. Comput. Sci..

[19]  Joost Engelfriet,et al.  Clique-Width for Four-Vertex Forbidden Subgraphs , 2005, FCT.

[20]  Dennis Saleh.  Zs , 2001 .

[21]  Jian Song,et al.  4-coloring H-free graphs when H is small , 2012, Discret. Appl. Math..

[22]  Myriam Preissmann,et al.  Linear Recognition of Pseudo-split Graphs , 1994, Discret. Appl. Math..

[23]  Dieter Rautenbach,et al.  On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree , 2004, SIAM J. Discret. Math..

[24]  Shenwei Huang,et al.  Improved complexity results on k-coloring Pt-free graphs , 2013, Eur. J. Comb..

[25]  David Schindl,et al.  Some new hereditary classes where graph coloring remains NP-hard , 2005, Discret. Math..

[26]  D. S. Malyshev.  On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number , 2011 .

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

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

[29]  Vadim V. Lozin,et al.  Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths , 2012, SWAT.

[30]  Shenwei Huang.  Improved Complexity Results on k-Coloring P t -Free Graphs , 2013, MFCS.

[31]  Vadim V. Lozin,et al.  Boundary classes of graphs for the dominating set problem , 2004, Discrete Mathematics.

[32]  Frank Harary,et al.  Graph Theory , 2016 .