On a list coloring conjecture of Reed

DOI10.1002/jgt.10054zbMath1012.05070OpenAlexW4246490489WikidataQ123263794 ScholiaQ123263794MaRDI QIDQ4798107

Ron Holzman, Tom Bohman

Publication date: 19 March 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10054

zbMATH Keywords

choosabilitylist coloringvertex-color degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Independent transversals in locally sparse graphs ⋮ On a Generalization of the Ryser-Brualdi-Stein Conjecture ⋮ An average degree condition for independent transversals ⋮ A General Framework for Hypergraph Coloring ⋮ Colorings, transversals, and local sparsity ⋮ List Colouring Constants of Triangle Free Graphs ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ On triangle-free list assignments ⋮ Packing list‐colorings ⋮ An asymptotically tight bound on the adaptable chromatic number ⋮ Asymptotically the list colouring constants are 1 ⋮ Cooperative colorings and independent systems of representatives

Cites Work

• Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2]

This page was built for publication: On a list coloring conjecture of Reed