Pages that link to "Item:Q536214"
From MaRDI portal
The following pages link to Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214):
Displaying 10 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- Star chromatic bounds (Q327688) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
