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

• Type: Journal
• Year: 2002
• Where: COMBINATORICS
• Authors: Garth Isaak
• Keywords: COMBINATORICS 2002, Line Graphs, List Size, Sum Choice Number