CriticalPfreeGraphs
From MaRDI portal
Software:38700
swMATH26981MaRDI QIDQ38700FDOQ38700
Author name not available (Why is that?)
Cited In (18)
- \(k\)-critical graphs in \(P_5\)-free graphs
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path
- Critical vertices and edges in \(H\)-free graphs
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Dynamic \(F\)-free coloring 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
- 3-Colorable Subclasses of $P_8$-Free Graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Colouring diamond-free graphs
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- Exhaustive generation of k‐critical ‐free 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
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs
This page was built for software: CriticalPfreeGraphs
