Coloring of (P₆, dart, K₄)-free graphs
From MaRDI portal
Publication:7025834
Cites work
- \(K_{4}\)-free graphs with no odd holes
- A survey of -boundedness
- A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Bisimplicial vertices in even-hole-free graphs
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- Claw-free graphs. VI: Colouring
- Coloring graphs without induced \(P_5\) or \(K_5-e\)
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Graph theory
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 3480625 (Why is no real title available?)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Normal hypergraphs and the perfect graph conjecture
- On the chromatic number of (\(P_6\), diamond)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- Perfect coloring and linearly χ-boundP6-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Square-Free Graphs with No Six-Vertex Induced Path
- Structural domination and coloring of some ( P₇ , C₇)-free graphs
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- The strong perfect graph theorem
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
- Vizing bound for the chromatic number on some graph classes
This page was built for publication: Coloring of \((P_6, \mathrm{dart}, K_4)\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025834)
