• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Статья

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

Discrete Mathematics. 2015. Vol. 338. No. 11. P. 1860-1865.

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. © 2015 Elsevier B.V. All rights reserved.