Article thumbnail

Some results on (a:b)-choosability

By Shai Gutner and Michael Tarsi

Abstract

AbstractA solution to a problem of Erdős, 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

Publisher: Elsevier B.V.
Year: 2009
DOI identifier: 10.1016/j.disc.2008.04.061
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3.amazonaws.com/prod-... (external link)
  • https://s3-eu-west-1.amazonaws... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.