Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable

@article{Wang2011PlanarGW,
  title={Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable},
  author={Yingqian Wang and Qian Wu and Liang Shen},
  journal={Discrete Applied Mathematics},
  year={2011},
  volume={159},
  pages={232-239}
}
It is known that planar graphs without cycles of length 4, i, j, or 9 with 4 < i < j < 9, except that i = 7 and j = 8, are 3-choosable. This paper proves that planar graphs without cycles of length 4, 7, 8, or 9 are also 3-choosable. © 2010 Elsevier B.V. All rights reserved.