论文信息 - Two cases of polynomial-time solvability for the coloring problem - 字舞流文

Two cases of polynomial-time solvability for the coloring problem

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

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

[3] Petr A. Golovach,et al. List coloring in the absence of two subgraphs , 2013, Discret. Appl. Math..

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

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

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

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

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

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

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

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

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

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