On embeddings of circulant graphs

zbMath1325.05059MaRDI QIDQ2346467

Ricardo Grande, Marston D. E. Conder

Publication date: 2 June 2015

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p28

zbMATH Keywords

Cayley graphsembeddingsgenuscirculants

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Group actions on combinatorial structures (05E18)

Related Items

A practical algorithm for the computation of the genus, Cubic vertex-transitive graphs admitting automorphisms of large order, Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians, Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices, The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic, Stronger ILPs for the Graph Genus Problem.

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum genus of vertex-transitive graphs
• The Cartesian product of three triangles can be embedded into a subspace of genus 7
• On the genus of \({\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\)
• The Magma algebra system. I: The user language
• On planarity and colorability of circulant graphs
• Das Geschlecht des vollständigen paaren Graphen
• The graph genus problem is NP-complete
• Additivity of the genus of a graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface