论文信息 - The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial - 字舞流文

The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial

We show that determining the chromatic number of a $\{P_5,\bar{P_5}\}$-free graph or a $\{P_5,K_p-e\}$-free graph can be done in polynomial time

Dmitriy S. Malyshev | O. O. Lobanova | D. Malyshev

[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

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

[3] Paul Erdös,et al. A Ramsey-type theorem for bipartite graphs , 2000 .

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

[5] Michel Habib,et al. A New Linear Algorithm for Modular Decomposition , 1994, CAAP.

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

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

[8] Paul D. Seymour,et al. Recognizing Berge Graphs , 2005, Comb..

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

[10] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..

[11] Jean-Luc Fouquet. A decomposition for a class of (P5, P5_5)-free graphs , 1993, Discret. Math..

[12] T. Gallai. Transitiv orientierbare Graphen , 1967 .

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

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

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