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 12 items.
- On \((\delta, \chi)\)-bounded families of graphs (Q540113) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- The asymptotic behavior of the correspondence chromatic number (Q2629278) (← links)
- Bounding the fractional chromatic number of \(K_\Delta\)-free graphs (Q2848565) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- \(\omega, \Delta\) and \(\chi\) (Q4242948) (← links)
- Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
- 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)
