Cited in
(19)- Dynamic \(F\)-free coloring of graphs
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
- Obstructions for three-coloring and list three-coloring \(H\)-free graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Colouring diamond-free graphs
- House of Graphs
- Computational aspects of greedy partitioning of graphs
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- 3-colorable subclasses of \(P_8\)-free graphs
- \(k\)-critical graphs in \(P_5\)-free graphs
- Critical vertices and edges in \(H\)-free graphs
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path
This page was built for software: CriticalPfreeGraphs
