User Settings
Article10.1016/j.disc.2015.04.019

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

D. S. Malyshev-2015-06-05-Discrete Mathematics
18

Chat with Paper

AI Agents for this Paper

No abstract available for this paper.

Keywords

MathematicsCombinatoricsDiscrete mathematics

Chat

Click to start Chat