Enumerating planar locally finite Cayley graphs
| dc.creator | Renault, David | |
| dc.date | 2003-09-11 | |
| dc.date.accessioned | 2026-07-07T03:20:18Z | |
| dc.date.available | 2026-07-07T03:20:18Z | |
| dc.description | 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. Keywords: vertex-transitive, Cayley graph, planar graph, tiling, labeling scheme | |
| dc.description | 19 pages, 6 PostScript figures, 12 embedded PsTricks figures. An additional file (~ 438ko.) containing the figures in appendix might be found at http://www.labri.fr/Perso/~renault/research/pages.ps.gz | |
| dc.identifier | https://arxiv.org/abs/cs/0309017 | |
| dc.identifier | http://arxiv.org/abs/cs/0309017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31782 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | Enumerating planar locally finite Cayley graphs | |
| dc.type | text |