期刊
DISCRETE MATHEMATICS
卷 309, 期 8, 页码 2260-2270出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disc.2008.04.061
关键词
(a:b)-choosability; Probabilistic methods; Complexity of graph choosability; kth choice number of a graph; List-chromatic conjecture; Strong chromatic number
类别
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据