



























In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a non-orientable surface. This family consists of all lexicographic product $C_n[mK_1]$, where $m\ge 3$, $n = sm$, with $s$ an integer not divisible by $4$. This answers a question posed in [S.\ Wilson, Families of regular graphs in regular maps, {\em Journal of Combinatorial Theory, Series B} 85 (2002), 269--289].
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。