## What is it about?

We find all posible maps on surfaces whose underlying graphs are the so-called Rose Window graphs and that satisfy that the symmetry group of the map can send any incident pair vertex-edge to any other incident pair vertex-edge. In other words, the maps that we study are arc transitive and have a Rose Window graph underlying them. Arc transitive maps have at most two flag orbits. In this paper we focus on the case of exactly two orbits, as the one orbit one was studied before. To do this, we investigate the connection of these maps to consistent cycles of the underlying graph with special emphasis on such maps of smallest possible valence, namely 4. We then give a complete classification of such maps whose underlying graphs are arc-transitive Rose Window graphs.

## Featured Image

Photo by Viola Kovács on Unsplash

## Why is it important?

Arc transitive maps have a large degree of symmetry; regular and chiral maps are examples of them. While regular and chiral maps have been studied in great detail, other types of arc transitive maps not so much. Here we give a families of examples to contribute to such study.

## Perspectives

## Read the Original

This page is a summary of: Arc‐transitive maps with underlying Rose Window graphs, Journal of Graph Theory, July 2020, Wiley,

DOI: 10.1002/jgt.22608.

You can read the full text:

## Resources

## Contributors

The following have contributed to this page