Work

An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps

Year: 2025

Type: article

Abstract: 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 surface, as well as a skeleton of a reflexible map on a non-orientable surface. This family consists of all lexicographic products C n [ m K 1 ] , where m ≥ 3 , n = s m , with s an integer not divisible by 4. This answers a question posed by Wilson in 2002.

Source: Journal of Combinatorial Theory Series B

DOI: 10.1016/j.jctb.2025.10.001

Authors: Isabel Hubard, Primož Potočnik, Primož Šparl

Institutions: Universidad Nacional Autónoma de México, University of Ljubljana, Institute of Mathematics, Physics, and Mechanics, University of Primorska

Language: English

Topic: Finite Group Theory Research

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funders: Consejo Nacional de Ciencia y Tecnología, Javna Agencija za Raziskovalno Dejavnost RS, Universidad Nacional Autónoma de México