Sciweavers

Share
COMBINATORICS
2002

Sum List Coloring 2*n Arrays

10 years 11 months ago
Sum List Coloring 2*n Arrays
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum over all choosable functions f of the sum of the sizes in f. We show that the sum choice number of a 2
Garth Isaak
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2002
Where COMBINATORICS
Authors Garth Isaak
Comments (0)
books