Pages that link to "Item:Q2352049"
From MaRDI portal
The following pages link to The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049):
Displayed 12 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions (Q6143681) (← links)