Enumerating planar locally finite Cayley graphs.
From MaRDI portal
Publication:2571720
DOI10.1007/s10711-005-0548-1zbMath1088.20014arXivcs/0309017OpenAlexW1968071742MaRDI QIDQ2571720
Publication date: 14 November 2005
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0309017
planar graphsCayley graphstilingsvertex-transitive graphsfinite state automatafinite presentationssolvable word problemlabelling schemes
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) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
The planar Cayley graphs are effectively enumerable. II ⋮ The uniform locally finite tilings of the plane ⋮ The vertex-transitive TLF-planar graphs ⋮ Metric dimensions of minor excluded graphs and minor exclusion in groups
Cites Work