Computer Science – Discrete Mathematics
Scientific paper
2008-02-15
Computer Science
Discrete Mathematics
Scientific paper
A solution to a problem of Erd\H{o}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. The simplest case of another problem, stated by the same authors, is settled, proving that every 2-choosable graph is also $(4:2)$-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.
No associations
LandOfFree
Choice numbers of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Choice numbers of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Choice numbers of graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-37733