CriticalPfreeGraphs

swMATH26981MaRDI QIDQ38700FDOQ38700

Author name not available (Why is that?)

Described by source

• Obstructions for three-coloring graphs with one forbidden induced subgraph

Cited In (18)

• \(k\)-critical graphs in \(P_5\)-free graphs
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path
• Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
• A survey on the computational complexity of coloring graphs with forbidden subgraphs
• Critical vertices and edges in \(H\)-free graphs
• 4-coloring \((P_6, \text{bull})\)-free graphs
• Obstructions for three-coloring and list three-coloring \(H\)-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
• Obstructions for three-coloring graphs without induced paths on six vertices
• Colouring diamond-free graphs
• Critical \((P_6, \mathrm{banner})\)-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
• 3-colorable subclasses of \(P_8\)-free graphs

This page was built for software: CriticalPfreeGraphs