Pages that link to "Item:Q2409536"

The following pages link to The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536):

Displaying 6 items.

• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← 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)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)