Pages that link to "Item:Q2359789"
From MaRDI portal
The following pages link to Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789):
Displayed 6 items.
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← 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)