Highly Influenced

# Circular choosability of graphs

@article{Zhu2005CircularCO, title={Circular choosability of graphs}, author={Xuding Zhu}, journal={Journal of Graph Theory}, year={2005}, volume={48}, pages={210-218} }

- Published in Journal of Graph Theory 2005
DOI:10.1002/jgt.20051

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) of a graph and prove that they are equivalent. Then we prove that for any graph , . Examples are given to show that this bound is sharp in the sense that for any , there is a graph with . It is also proved that -degenerate graphs have . This bound is also sharp: for each , there is a -degenerate graph with . This shows that could beâ€¦Â CONTINUE READING