The following pages link to (Q3424790):
Displaying 6 items.
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Upper bounds for the chromatic number of a graph (Q3439493) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
