Pages that link to "Item:Q4973236"
From MaRDI portal
The following pages link to On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236):
Displaying 5 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
