Pages that link to "Item:Q666663"
From MaRDI portal
The following pages link to Polynomial cases for the vertex coloring problem (Q666663):
Displaying 16 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← 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)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Polynomial instances of the packing coloring problem (Q2840736) (← 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)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
- Bivariate fractal interpolation functions on triangular domain for numerical integration and approximation (Q6564369) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
