Two cases of polynomial-time solvability for the coloring problem

The complexity of the coloring problem is known for all hereditary classes defined by two connected 5-vertex forbidden induced subgraphs except 13 cases. We update this result by proving polynomial-time solvability of the problem for two of the mentioned 13 classes.

[1]  Rajiv Raman,et al.  Colouring vertices of triangle-free graphs without forests , 2012, Discret. Math..

[2]  Dmitriy S. Malyshev,et al.  The coloring problem for classes with two small obstructions , 2013, Optim. Lett..

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

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

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

[6]  Pavol Hell,et al.  A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs , 1996, SIAM J. Discret. Math..

[7]  A. Gyárfás.  Problems from the world surrounding perfect graphs , 1987 .

[8]  Jayme Luiz Szwarcfiter,et al.  Characterizations and recognition of circular-arc graphs and subclasses: A survey , 2009, Discret. Math..

[9]  Vadim V. Lozin,et al.  Vertex coloring of graphs with few obstructions , 2017, Discret. Appl. Math..

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

[11]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[12]  Petr A. Golovach,et al.  List Coloring in the Absence of Two Subgraphs , 2013, CIAC.

[13]  Konrad Dabrowski,et al.  Colouring of graphs with Ramsey-type forbidden subgraphs , 2013, Theor. Comput. Sci..

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