Abstract
The weighted vertex coloring problem for a given weighted graph is to minimize the number of colors so that for each vertex the number of the colors that are assigned to this vertex is equal to its weight and the assigned sets of vertices are disjoint for any adjacent vertices. For all but four hereditary classes that are defined by two connected \(5 \)-vertex induced prohibitions, the computational complexity is known of the weighted vertex coloring problem with unit weights. For four of the six pairwise intersections of these four classes, the solvability was proved earlier of the weighted vertex coloring problem in time polynomial in the sum of the vertex weights. Here we justify this fact for the remaining two intersections.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
D. Král’, J. Kratochvíl, Z. Tuza, and G. Woeginger, “Complexity of Coloring Graphs without Forbidden Induced Subgraphs,” in Graph-Theoretic Concepts in Computer Science: Proceedings of 27th International Workshop (Boltenhagen, Germany, June 14–16, 2001) (Springer, Heidelberg, 2001), pp. 254–262 [Lecture Notes in Computer Science, Vol. 2204].
V. V. Lozin and D. S. Malyshev, “Vertex Coloring of Graphs with Few Obstructions,” Discrete Appl. Math. 216, 273–280 (2017).
P. A. Golovach, M. Johnson, D. Paulusma, and J. Song, “A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs,” J. Graph Theory. 84, 331–363 (2017).
K. Cameron, S. Huang, I. Penev, and V. Sivaraman, “The Class of \((P_7,C_4,C_5) \)-Free Graphs: Decomposition, Algorithms, and \(\chi \)-Boundedness,” J. Graph Theory 93 (4), 503–552 (2019).
K. Cameron, M. da Silva, F. Huang, and K. Vuskovic, “Structure and Algorithms for (Cap, Even Hole)-Free Graphs,” Discrete Math. 341, 463–473 (2018).
Y. Dai, A. Foley, and C. Hoàng, “On Coloring a Class of Claw-Free Graphs: To the Memory of Frédéric Maffray,” Electron. Notes Theor. Comput. Sci. 346, 369–377 (2019).
D. Fraser, A. Hamela, C. Hoàng, K. Holmes, and T. LaMantia, “Characterizations of \((4K_1,C_4,C_5)\)-Free Graphs,” Discrete Appl. Math. 231, 166–174 (2017).
C. Hoàng and D. Lazzarato, “Polynomial-Time Algorithms for Minimum Weighted Colorings of \((P_5,\overline {P}_5) \)-Free Graphs and Similar Graph Classes,” Discrete Appl. Math. 186, 105–111 (2015).
T. Karthick, F. Maffray, and L. Pasto, “Polynomial Cases for the Vertex Coloring Problem,” Algorithmica 81 (3), 1053–1074 (2017).
D. S. Malyshev, “The Coloring Problem for Classes with Two Small Obstructions,” Optim. Lett. 8 (8), 2261–2270 (2014).
D. S. Malyshev, “Two Cases of Polynomial-Time Solvability for the Coloring Problem,” J. Combin. Optim. 31 (2), 833–845 (2016).
D. S. Malyshev, “The Weighted Coloring Problem for Two Graph Classes Characterized by Small Forbidden Induced Structures,” Discrete Appl. Math. 47, 423–432 (2018).
D. S. Malyshev and O. O. Lobanova, “Two Complexity Results for the Vertex Coloring Problem,” Discrete Appl. Math. 219, 158–166 (2017).
D. V. Gribanov, D. S. Malyshev, and D. B. Mokeev, “Efficient Solvability of the Weighted Vertex Coloring Problem for Some Hereditary Class of Graphs with \(5 \)-Vertex Prohibitions,” Diskret. Anal. Issled. Oper. 27 (3), 71–87 (2020) [J. Appl. Ind. Math. 14 (3), 480–489 (2020)].
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, “The Strong Perfect Graph Theorem,” Ann. Math. 164, 51–229 (2006).
M. Grötschel, L. Lovász, and A. Schrijver, “Polynomial Algorithms for Perfect Graphs,” Ann. Discrete Math. 21, 325–356 (1984).
Funding
The authors were supported by the Russian Science Foundation (project no. 19–71–00005).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by Ya.A. Kopylov
Rights and permissions
About this article
Cite this article
Razvenskaya, O.O., Malyshev, D.S. Efficient Solvability of the Weighted Vertex Coloring Problem for Some Two Hereditary Graph Classes. J. Appl. Ind. Math. 15, 97–117 (2021). https://doi.org/10.1134/S1990478921010099
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478921010099