Journal
DISCRETE MATHEMATICS
Volume 309, Issue 8, Pages 2260-2270Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2008.04.061
Keywords
(a:b)-choosability; Probabilistic methods; Complexity of graph choosability; kth choice number of a graph; List-chromatic conjecture; Strong chromatic number
Categories
Ask authors/readers for more resources
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Applying probabilistic methods, an upper bound for the kth choice number of a graph is given. We also prove that a directed graph with maximum outdegree d and no odd directed cycle is (k(d + 1) : k)-choosable for every k >= 1. Other results presented in this article are related to the strong choice number of graphs (a generalization of the strong chromatic number). We conclude with complexity analysis of some decision problems related to graph choosability. (c) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available