Coloring graphs from lists with bounded size of their union

0027497 - MÚ 2006 RIV US eng J - Journal Article
Král´, D. - Sgall, Jiří
Coloring graphs from lists with bounded size of their union.
[Barvení grafů z listů s omezeným sjednocením.]
Journal of Graph Theory. Roč. 49, č. 3 (2005), s. 177-186. ISSN 0364-9024. E-ISSN 1097-0118
R&D Projects: GA ČR(CZ) GA201/01/1195; GA MŠMT(CZ) LN00A056
Institutional research plan: CEZ:AV0Z10190503
Keywords : graph coloring * list coloring
Subject RIV: BA - General Mathematics
Impact factor: 0.319, year: 2005

We construct a graph $G$ which is $k$-choosable from any lists of colors whose union has size at most $u$ but the same does not hold with lists whose union has size $u+1$.

Článek studuje listové barvení grafů.
Permanent Link: http://hdl.handle.net/11104/0117596