• A
• A
• A
• ABC
• ABC
• ABC
• А
• А
• А
• А
• А
Regular version of the site

## Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes

Journal of Applied and Industrial Mathematics. 2021. Vol. 15. No. 1. P. 97-117.
Razvenskaya O., Malyshev D.

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.