Add to ORKGVersion 28.4.2009 Abstract. 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 result is obtained for such graphs where no restriction is put on the number of ends. It is shown that such a graph can be built up from one-ended or finite planar graphs in a precise way. The results give a classification of the finitely generated groups with planar Cayley graphs. 1
AbstractWe call an infinite graph G accessible if there exists a natural number k such that any two ...
AbstractThe existence of groups which are not isomorphic with the group of automorphisms of any plan...
Abstract. The intersection graph of a group G is an undirected graph without loops and multiple edge...
AbstractWe consider the class of the topologically locally finite (in short TLF) planar vertex-trans...
We find necessary and sufficient conditions for a finitely generated group with more than one end to...
A construction is described that yields a complete characterization of a class of infinitely-ended, ...
Using results from group theory, we offer a concise proof of the imprimitivity of locally finite, ve...
We prove that in a certain statistical sense the Cayley graph of almost every finitely presented gro...
Abstract. The question of which groups admit planar Cayley graphs goes back over 100 years, having b...
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful,...
Given a finite group G, the generating graph Γ(G) of G has as vertices the non-identity elements of ...
AbstractIt is shown that the automorphism group of an infinite, locally finite, planar graph acts pr...
International audienceWe show that every finitely generated group G with an element of order at leas...
This talk is a report of joint work done with Mark Watkins [2]. It represents the start of an extens...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
AbstractWe call an infinite graph G accessible if there exists a natural number k such that any two ...
AbstractThe existence of groups which are not isomorphic with the group of automorphisms of any plan...
Abstract. The intersection graph of a group G is an undirected graph without loops and multiple edge...
AbstractWe consider the class of the topologically locally finite (in short TLF) planar vertex-trans...
We find necessary and sufficient conditions for a finitely generated group with more than one end to...
A construction is described that yields a complete characterization of a class of infinitely-ended, ...
Using results from group theory, we offer a concise proof of the imprimitivity of locally finite, ve...
We prove that in a certain statistical sense the Cayley graph of almost every finitely presented gro...
Abstract. The question of which groups admit planar Cayley graphs goes back over 100 years, having b...
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful,...
Given a finite group G, the generating graph Γ(G) of G has as vertices the non-identity elements of ...
AbstractIt is shown that the automorphism group of an infinite, locally finite, planar graph acts pr...
International audienceWe show that every finitely generated group G with an element of order at leas...
This talk is a report of joint work done with Mark Watkins [2]. It represents the start of an extens...
AbstractLet a be any vertex of a graph G. By deletion of a and of all those edges of G which are inc...
AbstractWe call an infinite graph G accessible if there exists a natural number k such that any two ...
AbstractThe existence of groups which are not isomorphic with the group of automorphisms of any plan...
Abstract. The intersection graph of a group G is an undirected graph without loops and multiple edge...