Optimal coloring of (P₂ + P₃, gem)-free graphs
From MaRDI portal
Publication:6972922
Cites work
- -boundedness and related problems on graphs without long induced paths: a survey
- A characterization of perfect graphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Chromatic bounds for some subclasses of (P₃ P₂)-free graphs
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
- Coloring of some crown-free graphs
- Colouring of (P₃ P₂)-free graphs
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On the chromatic number of (\(P_6\), diamond)-free graphs
- On the chromatic number of \(2 K_2\)-free graphs
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
- Optimal chromatic bound for (P₃ P₂, house)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Polynomial bounds for chromatic number VI. Adding a four-vertex path
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
- Separating polynomial \(\chi\)-boundedness from \(\chi\)-boundedness
- The strong perfect graph theorem
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms
This page was built for publication: Optimal coloring of \((P_2 + P_3, \mathrm{gem})\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972922)
