Planar graphs without 3-, 7-, and 8-cycles are 3-choosable

Zdenek Dvorak, Bernard Lidický, Riste Skrekovski. Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. Discrete Mathematics, 309(20):5899-5904, 2009. [doi]

Abstract

Abstract is missing.