Pages that link to "Item:Q764301"
From MaRDI portal
The following pages link to Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301):
Displaying 39 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Coloring of pseudocubic graphs in three colors (Q2287152) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (Q5099103) (← links)
- (Q5874489) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
