National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Coloring graphs from lists with bounded size of their union. KAM-DIMATIA. Series 2003-641 and ITI Series 2003-156
Král, D. ; Sgall, Jiří
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.