Classification of nonorientable regular embeddings of Hamming graphs

From MaRDI portal
Publication:449207

DOI10.1016/J.EJC.2012.04.001zbMATH Open1248.05124arXiv1107.3187OpenAlexW2038028295MaRDI QIDQ449207FDOQ449207


Authors: Gareth Jones, Young Soo Kwon Edit this on Wikidata


Publication date: 12 September 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the Hamming graph H(d,n). We show that there exists such an embedding if and only if n=2 and d=2, or n=3 or 4 and d>0, or n=6 and d=1 or 2. We also give constructions and descriptions of these embeddings.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Classification of nonorientable regular embeddings of Hamming graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449207)