Pages that link to "Item:Q6134643"
From MaRDI portal
The following pages link to Coloring graphs with no induced five‐vertex path or gem (Q6134643):
Displayed 13 items.
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← 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)
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)