Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )-free graphs
From MaRDI portal
Publication:6643347
Recommendations
Cites work
- A bound on the chromatic number of graphs without certain induced subgraphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Bounds for the chromatic number of some \(pK_2\)-free graphs
- Chromatic bounds for some classes of 2 K₂-free graphs
- Chromatic bounds for some subclasses of (P₃ P₂)-free graphs
- Colouring graphs with no induced six-vertex path or diamond
- Colouring of (P₃ P₂)-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- scientific article; zbMATH DE number 2200042 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- On (\(P_{5}\), diamond)-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- On the chromatic number of \(2 K_2\)-free graphs
- Paw-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Strong cliques in diamond-free graphs
- The strong perfect graph theorem
- Vertex colouring and forbidden subgraphs -- a survey
- Vizing bound for the chromatic number on some graph classes
Cited in
(3)
This page was built for publication: Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643347)
