The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs

D.S. Malyshev
2015 Discrete Mathematics  
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