The weighted coloring problem for two graph classes characterized by small forbidden induced structures

Abstract We show that the weighted coloring problem can be solved for { P 5 , b a n n e r } -free graphs and for { P 5 , d a r t } -free graphs in polynomial time on the sum of vertex weights.

[1]  Jian Song,et al.  A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs , 2014, J. Graph Theory.

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

[3]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[4]  Chính T. Hoàng,et al.  Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes , 2015, Discret. Appl. Math..

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

[6]  Dmitriy S. Malyshev.  Polynomial-time approximation algorithms for the coloring problem in some cases , 2017, J. Comb. Optim..

[7]  Daniël Paulusma,et al.  Colouring diamond-free graphs , 2015, J. Comput. Syst. Sci..

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

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

[10]  Petr A. Golovach,et al.  Coloring graphs characterized by a forbidden subgraph , 2012, Discret. Appl. Math..

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

[12]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[13]  Dmitriy S. Malyshev,et al.  Two complexity results for the vertex coloring problem , 2017, Discret. Appl. Math..

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