Pages that link to "Item:Q5232874"
From MaRDI portal
The following pages link to A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874):
Displayed 7 items.
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← 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)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)