Pages that link to "Item:Q4604026"

The following pages link to Exhaustive generation of <i>k</i>‐critical ‐free graphs (Q4604026):

Displaying 17 items.

• Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
• Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
• 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
• 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← 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)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
• Critical (\(P_5\), bull)-free graphs (Q6157414) (← links)
• Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
• Critical \((P_5,\mathit{dart})\)-free graphs (Q6606249) (← links)