Pages that link to "Item:Q5963654"
From MaRDI portal
The following pages link to Two cases of polynomial-time solvability for the coloring problem (Q5963654):
Displaying 6 items.
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
