Restricted colorings of graphs
Surveys in combinatorics, 1993
Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
A spectral technique for coloring random 3-colorable graphs (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
Random Structures & Algorithms
Proceedings of the ninth international conference on on Random structures and algorithms
Asymptotically the list colouring constants are 1
Journal of Combinatorial Theory Series B
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
A Note on Vertex List Colouring
Combinatorics, Probability and Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Journal of Graph Theory
Hi-index | 0.00 |
For an integer $b \geq 1$, the $b$-choice number of a graph $G$ is the minimum integer $k$ such that, for every assignment of a set $S(v)$ of at least $k$ colours to each vertex $v$ of $G$, there is a $b$-set colouring of $G$ that assigns to each vertex $v$ a $b$-set $B(v) \subseteq S(v) \; (|B(v)|=b)$ so that adjacent vertices receive disjoint $b$-sets. This is a generalization of the notions of choice number and chromatic number of a graph. Using probabilistic arguments, we show that, for some positive constant $c 0$ (independent of $b$), the $b$-choice number of any graph $G$ on $n$ vertices is at most $c (b\chi) (\ln (n/\chi)+1)$ where $\chi = \chi(G)$ denotes the chromatic number of $G$. For any fixed $b$, this bound is tight up to a constant factor for each $n,\chi$. This generalizes and extends a result of Noga Alon [1]wherein a similar bound was obtained for 1-choice numbers of complete $\chi$-partite graphs with each part having size $n/\chi$. We also show that the proof arguments are constructive, leading to polynomial time algorithms for the list colouring problem on certain classes of graphs, provided each vertex is given a list of sufficiently large size.