an:05566693
Zbl 1198.05049
Gutner, Shai; Tarsi, Michael
Some results on \((a:b)\)-choosability
EN
Discrete Math. 309, No. 8, 2260-2270 (2009).
00248994
2009
j
05C15
(a:b)-choosability; probabilistic methods; complexity of graph choosability; k-th choice number of a graph; list-chromatic conjecture; strong chromatic number
Summary: A solution to a problem of \textit{P. Erd??s}, \textit{A.L. Rubin}, and \textit{H. Taylor} [``Choosability in graphs,'' Combinatorics, graph theory and computing, Proc. West Coast Conf., Arcata/Calif. 1979, 125--157 (1980; Zbl 0469.05032)] 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 \(k\)th 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\geq 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.
Zbl 0469.05032