The maximum genus of vertex-transitive graphs
From MaRDI portal
Publication:908931
DOI10.1016/0012-365X(89)90175-1zbMath0694.05025MaRDI QIDQ908931
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
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
This page was built for publication: The maximum genus of vertex-transitive graphs