Pages that link to "Item:Q2171021"
From MaRDI portal
The following pages link to Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021):
Displaying 5 items.
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
