The planar Cayley graphs are effectively enumerable II
Combinatorics
2019-01-03 v1 Group Theory
Abstract
We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a consequence, we obtain an effective enumeration of the planar Cayley graphs, yielding in particular an affirmative answer to a question of Droms et al. asking whether the planar groups can be effectively enumerated.
Cite
@article{arxiv.1901.00347,
title = {The planar Cayley graphs are effectively enumerable II},
author = {Agelos Georgakopoulos and Matthias Hamann},
journal= {arXiv preprint arXiv:1901.00347},
year = {2019}
}
Comments
We split arXiv:1506.03361v2 into two parts. This is the second part