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}
}
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
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Choosability for the circular chromatic number

  • B. Mohar
  • http://www.fmf.unilj.si/ mohar/Problems…
  • 2003
Highly Influential
4 Excerpts

Circular colorings of planar graphs with prescribed girth

  • G. Fijavž, M. Juvan, B. Mohar, R. Škrekovski
  • 2002