Planar graphs without intersecting 5-cycles are 4-choosable

Daiqiang Hu, Jian-Liang Wu. Planar graphs without intersecting 5-cycles are 4-choosable. Discrete Mathematics, 340(8):1788-1792, 2017. [doi]

@article{HuW17-0,
  title = {Planar graphs without intersecting 5-cycles are 4-choosable},
  author = {Daiqiang Hu and Jian-Liang Wu},
  year = {2017},
  doi = {10.1016/j.disc.2017.03.012},
  url = {https://doi.org/10.1016/j.disc.2017.03.012},
  researchr = {https://researchr.org/publication/HuW17-0},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {340},
  number = {8},
  pages = {1788-1792},
}