| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8941838 | Discrete Applied Mathematics | 2018 | 10 Pages |
Abstract
We show that the weighted coloring problem can be solved for {P5,banner}-free graphs and for {P5,dart}-free graphs in polynomial time on the sum of vertex weights.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
D.S. Malyshev,