Enumerating planar locally finite Cayley graphs

  title={Enumerating planar locally finite Cayley graphs},
  author={David Renault},
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-problem-decidable presentation. 

From This Paper

Topics from this paper.
4 Citations
16 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 16 references

Planar Cayley diagrams : Weak point-symmetry

  • H. Levinson
  • Congressus Numerantium, 24:679–697
  • 1979
Highly Influential
3 Excerpts


  • C. Droms. Planar Cayley graphs
  • February
  • 2001

Beiträge zur Algebra and Geometrie

  • C. Droms, B. Servatius, H. Servatius. Connectivity, planarity of Cayley graphs
  • 39:269–282,
  • 1998

8th Ann

  • László Babai. The growth rate of vertex-transitive planar Proc
  • Symp. on Discrete Algorithms, pages 564–573. New…
  • 1997
1 Excerpt

Maps , hypermaps and their automorphisms : a survey

  • Thomas Chaboud.
  • Pavages et Graphes de Cayley planaires . PhD…
  • 1995


  • R. Cori, A. Machi
  • hypermaps and their automorphisms : a survey…
  • 1992
1 Excerpt

Tilings and Patterns

  • B. Grünbaum, G. C. Shephard
  • W. H. Freeman Company
  • 1987
2 Excerpts

Surfaces and planar discontinuous groups

  • H. Zieschang, E. Vogt, H. D. Coldewey
  • Number 835 in Lecture Notes in Mathematics…
  • 1980

Similar Papers

Loading similar papers…