The following pages link to Near-optimal list colorings (Q4521554):
Displayed 14 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- On the chromatic number of Latin square graphs (Q2629269) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)