Pages that link to "Item:Q2284725"

The following pages link to Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725):

Displaying 10 items.

• Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
• Strong cliques in diamond-free graphs (Q5919069) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
• Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← links)
• Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)