Choice numbers for unions of graphs
Date
1996
Authors
Ferneyhough, Sheila
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The problem of determining choice numbers for unions of graphs is investigated, with particular attention being paid to the case where one of the graphs is 2-choosable. It is shown that all 2-choosable graphs are (2k k )-choosable for all positive values of k. New results on (a b)-choosability of planar graphs, bipartite graphs and Cartesian products of graphs are also presented.