Digraphs with exactly one Eulerian tour

We give two combinatorial proofs of the fact that the number of loopless digraphs on the vertex set $[n]$ with no isolated vertices and with exactly one Eulerian tour up to a cyclic shift is $\frac{1}{2}(n-1)!C_{n}$, where $C_{n}$ denotes the $n$-th Catalan number. We construct a bijection with a se...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Grisales, Luz, Labelle, Antoine, Posada, Rodrigo, Dimitrov, Stoyan
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!