Pages that link to "Item:Q5405071"
From MaRDI portal
The following pages link to Complexity of Coloring Graphs without Paths and Cycles (Q5405071):
Displaying 5 items.
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
