Near-optimal list colorings
From MaRDI portal
Publication:4521554
DOI<376::AID-RSA10>3.0.CO;2-0 10.1002/1098-2418(200010/12)17:3/4<376::AID-RSA10>3.0.CO;2-0zbMath0971.05047OpenAlexW2046229563MaRDI QIDQ4521554
Bruce A. Reed, Michael S. O. Molloy
Publication date: 19 December 2000
Full work available at URL: https://doi.org/10.1002/1098-2418(200010/12)17:3/4<376::aid-rsa10>3.0.co;2-0
Related Items (16)
On the chromatic number of Latin square graphs ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ The \(n\)-queens completion problem ⋮ Extension from precoloured sets of edges ⋮ Asymptotically good edge correspondence colourings ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Edge-colouring graphs with local list sizes ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Tight embeddings of partial quadrilateral packings ⋮ On a hypergraph matching problem ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ Acyclic edge colourings of graphs with large girth ⋮ Pseudorandom hypergraph matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- List-colourings of graphs
- A dense infinite Sidon sequence
- Asymptotically good list-colorings
- Weighted sums of certain dependent random variables
- An algorithmic approach to the Lovász local lemma. I
- A parallel algorithmic version of the local lemma
- The strong chromatic number of a graph
- On Systems of Small Sets with No Large Δ-Subsystems
- On Medians of Lattice Distributions and a Game with Two Dice
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: Near-optimal list colorings
