Castling tree of tight Dyck nests with applications to odd and middle-levels graphs

Italo J. Dejter

A subfamily of Dyck words called tight Dyck words is seen to correspond, via a "castling" procedure, to the vertex set of an ordered tree $T$. From $T$, a "blowing" operation recre…