The planar Cayley graphs are effectively enumerable II

DOI10.1016/J.EJC.2022.103668MaRDI QIDQ6311917arXivFDO

Authors Agelos Georgakopoulos, Matthias Hamann

Publication date 2 January 2019

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.EJC.2022.103668

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65)

arXiv classification

math.COmath.GR

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.

This page was built for publication: The planar Cayley graphs are effectively enumerable II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311917)