Eulerian digraphs and Dyck words, a bijection
From MaRDI portal
Publication:6252999
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.
This page was built for publication: Eulerian digraphs and Dyck words, a bijection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6252999)
