On choosability with separation of planar graphs with lists of different sizes

Hal A. Kierstead, Bernard Lidický. On choosability with separation of planar graphs with lists of different sizes. Discrete Mathematics, 338(10):1779-1783, 2015. [doi]

Abstract

Abstract is missing.