The vertex-transitive TLF-planar graphs
| dc.creator | Renault, D. | |
| dc.date | 2004-12-17 | |
| dc.date.accessioned | 2026-07-07T03:22:15Z | |
| dc.date.available | 2026-07-07T03:22:15Z | |
| dc.description | 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 graphs with a finite local representation and a special kind of finite state automaton named labeling scheme. As a result, we are able to enumerate and describe all TLF-planar vertex-transitive graphs of any given degree. Also, we are able decide to whether any TLF-planar transitive graph is Cayley or not. | |
| dc.description | Article : 23 pages, 15 figures Appendix : 13 pages, 72 figures Submitted to Discrete Mathematics The appendix is accessible at http://www.labri.fr/~renault/research/research.html | |
| dc.identifier | https://arxiv.org/abs/cs/0412078 | |
| dc.identifier | http://arxiv.org/abs/cs/0412078 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32523 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.1; G.2.2 | |
| dc.title | The vertex-transitive TLF-planar graphs | |
| dc.type | text |