Pages that link to "Item:Q344861"
From MaRDI portal
The following pages link to Complexity of coloring graphs without paths and cycles (Q344861):
Displaying 29 items.
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- (Q4414494) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
- Vertex-critical \((P_5, \mathrm{chair})\)-free graphs (Q6069143) (← links)
- Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
- Critical \((P_5,\mathit{dart})\)-free graphs (Q6606249) (← links)
