Planar transitive graphs

zbMath1398.05071arXiv1511.08777MaRDI QIDQ1991415

Matthias Hamann

Publication date: 30 October 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08777

zbMATH Keywords

cyclesplanar graphstransitive graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (4)

A Stallings type theorem for quasi-transitive graphs ⋮ Splitting groups with cubic Cayley graphs of connectivity two ⋮ The planar Cayley graphs are effectively enumerable. II ⋮ Accessibility in transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex-transitive graphs and accessibility
• Accessibility in transitive graphs
• The structure of locally finite two-connected graphs
• Generating the cycle space of planar graphs
• Characterising planar Cayley graphs and Cayley complexes in terms of group presentations
• A theorem on planar covering surfaces with applications to 3-manifolds
• Congruent Graphs and the Connectivity of Graphs
• Infinite-ended groups with planar Cayley graphs

This page was built for publication: Planar transitive graphs