Critical (P₅,dart)-free graphs
From MaRDI portal
Publication:6606249
Cites work
- k-critical graphs in P₅-free graphs
- A certifying algorithm for 3-colorability of \(P _{5}\)-free graphs
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- Certifying coloring algorithms for graphs without long induced paths
- Complexity of coloring graphs without paths and cycles
- Constructions of k-critical P₅-free graphs
- Critical (\(P_5\), bull)-free graphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
- Graph theory
- House of graphs 2.0: a database of interesting graphs and more
- On 3-colorable P₅-free graphs
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
- Reducibility among combinatorial problems
- Some results on \(k\)-critical \(P_5\)-free graphs
- The strong perfect graph theorem
- Vertex-critical \((P_5, \mathrm{chair})\)-free graphs
- Vertex-critical \((P_5\), banner)-free graphs
Cited in
(8)- Vertex-critical (P₅,W₄)-free graphs
- Some results on critical (P₅, H)-free graphs
- Some results on critical (P₅,H)-free graphs
- Vertex-critical graphs in co-gem-free graphs
- On the finiteness of k-vertex-critical 2P₂-free graphs with forbidden induced squids or bulls
- Vertex-critical (P₅, W₄)-free graphs
- Minimal obstructions to C₅-coloring in hereditary graph classes
- Vertex-critical graphs in subfamilies of (P₄+ P₁)-free graphs
This page was built for publication: Critical \((P_5,\mathit{dart})\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606249)
