Pages that link to "Item:Q1933643"
From MaRDI portal
The following pages link to Three complexity results on coloring \(P_k\)-free graphs (Q1933643):
Displaying 26 items.
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← 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 (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
