Exponentially many Z5-colorings in simple planar graphs
Combinatorics
2020-11-25 v1
Abstract
Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.
Keywords
Cite
@article{arxiv.2011.12163,
title = {Exponentially many Z5-colorings in simple planar graphs},
author = {Rikke Langhede and Carsten Thomassen},
journal= {arXiv preprint arXiv:2011.12163},
year = {2020}
}
Comments
22 pages, 1 figure