The genus of the Gray graph is 7
From MaRDI portal
Publication:1767625
DOI10.1016/j.ejc.2004.01.015zbMath1058.05018OpenAlexW2014458385WikidataQ56001775 ScholiaQ56001775MaRDI QIDQ1767625
Dragan Marušič, Tomaž Pisanski, Stephen E. Wilson
Publication date: 8 March 2005
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.01.015
Related Items
A practical algorithm for the computation of the genus, Semisymmetric graphs from polytopes, Symmetric graphs from polytopes of high rank, On invariant notions of Segre varieties in binary projective spaces, THE VELDKAMP SPACE OF THE SMALLEST SLIM DENSE NEAR HEXAGON, Stronger ILPs for the Graph Genus Problem., New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Retracts of strong products of 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\)
- Cyclic Haar graphs
- Polycyclic configurations
- On edge but not vertex transitive regular graphs
- On the genus of the semidirect product of ℤ9 by ℤ3
- A graph which is edge transitive but not arc transitive
- The Gray graph revisited
- An Edge but not Vertex Transitive Cubic Graph*
- Self-dual configurations and regular graphs
