Pages that link to "Item:Q2440105"
From MaRDI portal
The following pages link to Coloring graphs without short cycles and long induced paths (Q2440105):
Displayed 8 items.
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← 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)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)