Pages that link to "Item:Q2251141"
From MaRDI portal
The following pages link to Coloring vertices of claw-free graphs in three colors (Q2251141):
Displaying 7 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- The 2nd-order conditional 3-coloring of claw-free graphs (Q924141) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- (Q5755526) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)