The following pages link to (Q2770587):
Displaying 34 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← 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)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← 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)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- (Q5075768) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
