The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs |
scientific article |
Statements
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (English)
0 references
29 June 2015
0 references
3-colorability problem
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
