Pages that link to "Item:Q4646937"
From MaRDI portal
The following pages link to Coloring (gem, co‐gem)‐free graphs (Q4646937):
Displaying 14 items.
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs (Q6143379) (← links)
- Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
