Exponentially many Z5-colorings in simple planar graphs
arXiv:2011.12163
Abstract
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
22 pages, 1 figure
arXiv:2011.12163
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
22 pages, 1 figure