| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949734 | Discrete Applied Mathematics | 2017 | 9 Pages |
Abstract
We show that the chromatic number of {P5,Kpâe}-free graphs can be computed in polynomial time for each fixed p. Additionally, we prove polynomial-time solvability of the weighted vertex coloring problem for {P5,P3+P2¯}-free graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
D.S. Malyshev, O.O. Lobanova,