Pages that link to "Item:Q6086395"
From MaRDI portal
The following pages link to Graph and hypergraph colouring via nibble methods: a survey (Q6086395):
Displaying 3 items.
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)