List Coloring with a Bounded Palette

DOI10.1002/jgt.22013zbMath1367.05067arXiv1507.03495OpenAlexW3123514942MaRDI QIDQ2958200

Ross J. Kang, Marthe Bonamy

Publication date: 1 February 2017

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

Full work available at URL: https://arxiv.org/abs/1507.03495

zbMATH Keywords

graph coloringprobabilistic methodlist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Asymmetric list sizes in bipartite graphs ⋮ Proportional 2-choosability with a bounded palette

Cites Work

• Unnamed Item
• Coloring, sparseness and girth
• Hypergraph containers
• On the choosability of complete multipartite graphs with part size three
• List Colourings of Regular Hypergraphs
• A note on random greedy coloring of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• Independent sets in hypergraphs
• Improper Choosability and Property B
• Coloring graphs from lists with bounded size of their union

This page was built for publication: List Coloring with a Bounded Palette