The planar Cayley graphs are effectively enumerable. I: Consistently planar graphs

DOI10.1007/s00493-019-3763-3zbMath1463.05257arXiv1506.03361OpenAlexW2978491636WikidataQ126984312 ScholiaQ126984312MaRDI QIDQ2288356

Matthias Hamann, Angelos Georgakopoulos

Publication date: 17 January 2020

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03361

zbMATH Keywords

effective enumerationplanar finitely generated Cayley graphs

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (4)

On planar Cayley graphs and Kleinian groups ⋮ The planar Cayley graphs are effectively enumerable. II ⋮ THE RANKS OF PLANARITY FOR VARIETIES OF COMMUTATIVE SEMIGROUPS ⋮ Unnamed Item

This page was built for publication: The planar Cayley graphs are effectively enumerable. I: Consistently planar graphs