The following pages link to (Q2770587):
Displayed 19 items.
- 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)
- 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)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← 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)