Sum List Coloring 2 n Arrays
Garth Isaak · The Electronic Journal of Combinatorics · 2002
Ag raph isf-choosable if for every collection of lists with list sizes specied 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 .W e show that the sum choice number of a 2 n array (equivalent to list edge coloring K2;n and to list vertex coloring the cartesian product K22Kn )i sn 2 + d5n=3e.