Original title: Coloring graphs from lists with bounded size of their union. KAM-DIMATIA. Series 2003-641 and ITI Series 2003-156
Authors: Král, D. ; Sgall, Jiří
Document type: Research reports
Year: 2003
Language: eng
Series: KAM-DIMATIA.
Abstract: 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.
Keywords: graph coloring; list coloring
Project no.: CEZ:AV0Z1019905 (CEP), CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), GA201/01/1195 (CEP)
Funding provider: GA MŠk, GA ČR

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0072428

Permalink: http://www.nusl.cz/ntk/nusl-26043


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports