Circular regular dessins

A dessin is called circular if the boundary of each face is a circuit (a simple cycle). In this paper, we address the problem of characterizing edge-transitive graphs that have or do not have edge-transitive circular embeddings. We solve the problem for various families of special graphs, which show...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algebraic combinatorics 2021-09, Vol.54 (2), p.441-456
1. Verfasser:	Fan, Wenwen
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Combinatorics Computer Science Convex and Discrete Geometry Graphs Group Theory and Generalizations Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A dessin is called circular if the boundary of each face is a circuit (a simple cycle). In this paper, we address the problem of characterizing edge-transitive graphs that have or do not have edge-transitive circular embeddings. We solve the problem for various families of special graphs, which show that the problem is interesting and difficult.
ISSN:	0925-9899 1572-9192
DOI:	10.1007/s10801-020-00996-7