The following pages link to CriticalPfreeGraphs (Q38700):
Displaying 18 items.
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- 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)
- Colouring diamond-free graphs (Q2402373) (← 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)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Exhaustive generation of <i>k</i>‐critical ‐free graphs (Q4604026) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← 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)
