The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices.

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

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

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

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

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

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

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

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

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

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

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

[12]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[13]  Дмитрий Сергеевич Малышев,et al.  О пересечении и симметрической разности семейств граничных классов для задач о раскраске и о хроматическом числе@@@On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number , 2012 .

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

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

[16]  Ingo Schiermeyer,et al.  Three-colourability and forbidden subgraphs. II: polynomial algorithms , 2002, Discret. Math..

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

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

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

[20]  Dmitriy S. Malyshev,et al.  The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial , 2015, ArXiv.

[21]  R. L. Brooks.  On Colouring the Nodes of a Network , 1941 .

[22]  Dmitriy S. Malyshev,et al.  Two cases of polynomial-time solvability for the coloring problem , 2016, J. Comb. Optim..