The following pages link to (Q6084349):
Displaying 6 items.
- Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
- Independent transversals in bipartite correspondence-covers (Q5888915) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
- Coloring hypergraphs from random lists (Q6671607) (← links)