Pages that link to "Item:Q2978175"

The following pages link to 4‐Coloring <i>P</i> ₆ ‐Free Graphs with No Induced 5‐Cycles (Q2978175):

Displaying 11 items.

• 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)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← 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)
• Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)