Circular choosability is rational

Authors:
Tobias Müller;Robert J. Waters
Affiliations:
School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel;Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 7
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Circular chromatic number: a survey

Discrete Mathematics
List circular coloring of trees and cycles

Journal of Graph Theory
Circular choosability of graphs

Journal of Graph Theory
On two questions about circular choosability

Journal of Graph Theory
Circular choosability via combinatorial Nullstellensatz

Journal of Graph Theory
Circular choosability

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The circular choosability or circular list chromatic number of a graph is a list-version of the circular chromatic number, that was introduced by Mohar in 2002 and has been studied by several groups of authors since then. One of the nice properties that the circular chromatic number enjoys is that it is a rational number for all finite graphs G, and a fundamental question, posed by Zhu and reiterated by others, is whether the same holds for the circular choosability. In this paper we show that this is indeed the case.