Related papers: Enumerating planar locally finite Cayley graphs

We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

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…

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…

Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…

We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…

We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

Given a connected, locally finite, quasi-transitive graph $X$ which is quasi-isometric to a planar graph $\Gamma$, we remark that one can upgrade $\Gamma$ to be a planar Cayley graph, answering a question raised by Esperet--Giocanti and…

A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…