Number of the records: 1
Coloring graphs from lists with bounded size of their union. KAM-DIMATIA. Series 2003-641 and ITI Series 2003-156
- 1.0175445 - MU-W 20030198 RIV CZ eng V - Research Report
Král, D. - Sgall, Jiří
Coloring graphs from lists with bounded size of their union. KAM-DIMATIA. Series 2003-641 and ITI Series 2003-156.
Praha: Charles University, 2003. 12 s. KAM-DIMATIA.
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : graph coloring * list coloring
Subject RIV: BA - General Mathematics
We construct a graph G which is k-choosable from any lists of colors whoseunion has size at most u but the same does not hold with lists whose union has size u+1.
Permanent Link: http://hdl.handle.net/11104/0072428
Number of the records: 1