A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
2015
Discrete Mathematics
Preserved Fulltext
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.
doi:10.1016/j.disc.2015.04.019
fatcat:5kklqcsohbauvg2c543a42bfve