Paper Info
Title
Sum List Coloring 2 x n Arrays
Abstract
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 integral of the sum of the sizes in integral. We show that the sum choice number of a 2 x n array (equivalent to list edge coloring K-2,K-n and to list vertex coloring the cartesian product K-2 square K-n) is n(2) + [5n/3].
Year
Venue
Keywords
2002
ELECTRONIC JOURNAL OF COMBINATORICS
edge coloring,list coloring,cartesian product
Field
DocType
Volume
Edge coloring,Discrete mathematics,Complete coloring,Combinatorics,Fractional coloring,Cartesian product,List coloring,Brooks' theorem,List edge-coloring,Greedy coloring,Mathematics
Journal
9.0
Issue
ISSN
Citations 
1
1077-8926
10
PageRank 
References 
Authors
1.78
6
1
Name
Order
Citations
PageRank
Garth Isaak117224.01