Pages that link to "Item:Q1671374"
From MaRDI portal
The following pages link to The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374):
Displayed 6 items.
- 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 computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)