CriticalPfreeGraphs
From MaRDI portal
Software:38700
No author found.
Related Items (18)
Colouring graphs with no induced six-vertex path or diamond ⋮ Dynamic \(F\)-free coloring of graphs ⋮ Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs ⋮ Colouring diamond-free graphs ⋮ 4-coloring \((P_6, \text{bull})\)-free graphs ⋮ Exhaustive generation of k‐critical ‐free graphs ⋮ Computational aspects of greedy partitioning of graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Better 3-coloring algorithms: excluding a triangle and a seven vertex path ⋮ Critical vertices and edges in \(H\)-free graphs ⋮ Critical \((P_6, \mathrm{banner})\)-free graphs ⋮ 3-Colorable Subclasses of $P_8$-Free Graphs ⋮ Obstructions for three-coloring graphs without induced paths on six vertices ⋮ On 3-coloring of \((2P_4,C_5)\)-free graphs ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs ⋮ On 3-coloring of \((2P_4,C_5)\)-free graphs ⋮ Colouring graphs with no induced six-vertex path or diamond
This page was built for software: CriticalPfreeGraphs
