The planar Cayley graphs are effectively enumerable. II

DOI10.1016/j.ejc.2022.103668OpenAlexW4312221634MaRDI QIDQ2700978

Matthias Hamann, Angelos Georgakopoulos

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

effective enumerationplanar finitely generated Cayley graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision problems for 3-manifolds and their fundamental groups
• On the classification of Kleinian groups. I: Koebe groups
• Connectivity and planarity of Cayley graphs
• Vertex-transitive graphs and accessibility
• Special embeddings of Cayley diagrams
• Combinatorial group theory.
• The structure of locally finite two-connected graphs
• Planar transitive graphs
• The planar Cayley graphs are effectively enumerable. I: Consistently planar graphs
• Generating the cycle space of planar graphs
• The planar cubic Cayley graphs of connectivity 2
• Characterising planar Cayley graphs and Cayley complexes in terms of group presentations
• Introduction to group theory. Translated from the Russian. With a new chapter.
• Enumerating planar locally finite Cayley graphs.
• On planar Cayley graphs and Kleinian groups
• Infinite-ended groups with planar Cayley graphs

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