Pages that link to "Item:Q2465649"

The following pages link to On the complexity of 4-coloring graphs without long induced paths (Q2465649):

Displaying 19 items.

• Complexity of coloring graphs without paths and cycles (Q344861) (← links)
• 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)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
• Two complexity results for the vertex coloring problem (Q505438) (← 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)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
• List coloring in the absence of a linear forest (Q2258070) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
• 4‐Coloring <i>P</i> ₆ ‐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 Vertices of Triangle-Free Graphs (Q3057624) (← links)
• List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
• Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)