Obstructions for three-coloring graphs with one forbidden induced subgraph
From MaRDI portal
Publication:4575707
Recommendations
Cited in
(17)- Critical vertices and edges in \(H\)-free graphs
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Certifying coloring algorithms for graphs without long induced paths
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Dynamic \(F\)-free coloring of graphs
- Obstructions for three-coloring and list three-coloring \(H\)-free graphs
- Computational aspects of greedy partitioning of graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Colouring diamond-free graphs
- 3-colourability and forbidden subgraphs
- CriticalPfreeGraphs
- Three forbidden subgraphs for line graphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Critical (\(P_5\), bull)-free graphs
- 3-colorable subclasses of \(P_8\)-free graphs
- A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs
This page was built for publication: Obstructions for three-coloring graphs with one forbidden induced subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575707)