Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423289 | Discrete Mathematics | 2015 | 6 Pages |
Abstract
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
D.S. Malyshev,