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]

Abstract

Abstract is missing.