<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=175133"><dc:title>An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps</dc:title><dc:creator>Hubard,	Isabel	(Avtor)
	</dc:creator><dc:creator>Potočnik,	Primož	(Avtor)
	</dc:creator><dc:creator>Šparl,	Primož	(Avtor)
	</dc:creator><dc:subject>rotary maps</dc:subject><dc:subject>chiral maps</dc:subject><dc:subject>orientable reflexible maps</dc:subject><dc:subject>non-orientable rotary maps</dc:subject><dc:description>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[mK_1]$, where $m \ge 3, n=sm$, with $s$ an integer not divisible by $4$. This answers a question posed by Wilson in 2002.</dc:description><dc:date>2026</dc:date><dc:date>2025-10-17 11:47:31</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>175133</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
