Coloring (gem, co‐gem)‐free graphs
From MaRDI portal
Publication:4646937
Recommendations
- Colouring diamond-free graphs
- Colouring diamond-free graphs
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- On cocolourings and cochromatic numbers of graphs
- Colouring (P_r+P_s)-Free Graphs
- Colouring \((P_r + P_s)\)-free graphs
- Coloring of some crown-free graphs
- Colouring of (P₃ P₂)-free graphs
- Colouring vertices of triangle-free graphs
- Coloring graphs with no induced five‐vertex path or gem
Cited in
(16)- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- On algorithms for (P₅, gem)-free graphs
- Colouring diamond-free graphs
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- On rectangle intersection graphs with stab number at most two
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Square-Free Graphs with No Six-Vertex Induced Path
- On graphs with no induced five‐vertex path or paraglider
- Coloring graphs with no induced five‐vertex path or gem
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs
This page was built for publication: Coloring (gem, co‐gem)‐free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646937)
