Back to Search
Start Over
The planar Cayley graphs are effectively enumerable II.
- Source :
-
European Journal of Combinatorics . May2023, Vol. 110, pN.PAG-N.PAG. 1p. - Publication Year :
- 2023
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *PLANAR graphs
*CAYLEY graphs
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 110
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 162921106
- Full Text :
- https://doi.org/10.1016/j.ejc.2022.103668