(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles

Gerard J. Chang, Nicolas Roussel. (Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles. Discrete Mathematics, 312(14):2126-2130, 2012. [doi]

Abstract

Abstract is missing.