|
This article is cited in 1 scientific paper (total in 1 paper)
Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions
D. V. Gribanovab, D. S. Malyshevab, D. B. Mokeevba a National Research University “Higher School of Economics”, 25/12 Bolshaya Pechyorskaya Street, 603155 Nizhny Novgorod, Russia
b Lobachevsky State University of Nizhny Novgorod, 23 Gagarin Avenue, 603950 Nizhny Novgorod, Russia
Abstract:
We consider the problem of minimizing the number of colors in the colorings of the vertices of a given graph so that, to each vertex there is assigned some set of colors whose number is equal to the given weight of the vertex; and adjacent vertices receive disjoint sets. For all hereditary classes defined by a pair of forbidden induced connected subgraphs on $5$ vertices but four cases, the computational complexity of the weighted vertex coloring problem with unit weights is known. We prove the polynomial solvability on the sum of the vertex weights for this problem and the intersection of two of the four open cases. We hope that our result will be helpful in resolving the computational complexity of the weighted vertex coloring problem in the above-mentioned forbidden subgraphs. Illustr. 1, bibliogr. 18.
Keywords:
weighted vertex coloring problem, hereditary class, computational complexity.
Received: 25.07.2019 Revised: 06.01.2020 Accepted: 19.02.2020
Citation:
D. V. Gribanov, D. S. Malyshev, D. B. Mokeev, “Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions”, Diskretn. Anal. Issled. Oper., 27:3 (2020), 71–87; J. Appl. Industr. Math., 14:3 (2020), 480–489
Linking options:
https://www.mathnet.ru/eng/da957 https://www.mathnet.ru/eng/da/v27/i3/p71
|
Statistics & downloads: |
Abstract page: | 196 | Full-text PDF : | 49 | References: | 10 | First page: | 2 |
|