Exponentially many Z5-colorings in simple planar graphs

Abstract

Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.