The maximum genus of vertex-transitive graphs

DOI10.1016/0012-365X(89)90175-1zbMath0694.05025MaRDI QIDQ908931

Martin Škoviera, Roman Nedela

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum genusvertex-transitive graphs

Mathematics Subject Classification ID

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

Related Items (6)

Upper embeddability of graphs ⋮ Genus of the Cartesian product of triangles ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ On embeddings of circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• A note on upper embeddable graphs
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Theory of Maps on Orientable Surfaces

This page was built for publication: The maximum genus of vertex-transitive graphs