Number of the records: 1

Coloring graphs from lists with bounded size of their union

SYSNO ASEP	0027497
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Ostatní články
Title	Coloring graphs from lists with bounded size of their union
Title	Barvení grafů z listů s omezeným sjednocením
Author(s)	Král´, D. (CZ) Sgall, Jiří (MU-W)_{RID, ORCID, SAI}
Source Title	Journal of Graph Theory. - : Wiley - ISSN 0364-9024 Roč. 49, č. 3 (2005), s. 177-186
Number of pages	10 s.
Language	eng - English
Country	US - United States
Keywords	graph coloring ; list coloring
Subject RIV	BA - General Mathematics
R&D Projects	GA201/01/1195 GA ČR - Czech Science Foundation (CSF)
	LN00A056 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Annotation	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$.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2006

Number of the records: 1