Pages that link to "Item:Q505438"
From MaRDI portal
The following pages link to Two complexity results for the vertex coloring problem (Q505438):
Displayed 13 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 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)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← 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)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)