Coloring graphs from lists with bounded size of their union

DOI10.1002/jgt.20073zbMath1106.05040DBLPjournals/jgt/KralS05OpenAlexW4243733834WikidataQ57601552 ScholiaQ57601552MaRDI QIDQ5462386

Jiří Sgall, Daniel Král'

Publication date: 1 August 2005

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

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

zbMATH Keywords

graph coloringchoosabilitylist coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Improper Choosability and Property B ⋮ List Coloring with a Bounded Palette ⋮ Proportional 2-choosability with a bounded palette

Cites Work

• Graph colorings with local constraints -- a survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring graphs from lists with bounded size of their union