Sum list coloring \(2\times n\) arrays
type: Item
instance of: scholarly article
title: Sum list coloring \(2\times n\) arrays
zbMATH Open document ID: 1003.05041
author: Garth Isaak
published in: The Electronic Journal of Combinatorics
publication date: 2002-09-22T00:00:00Z
full work available at URL: https://eudml.org/doc/122307
full work available at URL: v9i1n8.html
review text: Summary: 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 \times n\) array (equivalent to list edge coloring \(K_{2,n}\) and to list vertex coloring the Cartesian product \(K_2 \square K_n\)) is \(n^2 + \lceil 5n/3 \rceil\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1803675
zbMATH Keywords: sum choice number
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1803675