Eulerian digraphs and Dyck words, a bijection
Discrete Mathematics
2014-07-10 v1 Combinatorics
Abstract
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph.
Cite
@article{arxiv.1407.2461,
title = {Eulerian digraphs and Dyck words, a bijection},
author = {Pietro Codara and Ottavio M. D'Antona and Marco Genuzio},
journal= {arXiv preprint arXiv:1407.2461},
year = {2014}
}