Gray visiting Motzkins
From MaRDI portal
Publication:1403332
DOI10.1007/s00236-002-0097-0zbMath1018.05002MaRDI QIDQ1403332
Publication date: 1 September 2003
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-002-0097-0
Related Items
On the reconstruction of a Motzkin Tree from its code, Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, Prefix partitioned Gray codes for particular cross-bifix-free sets, Gray code for permutations with a fixed number of cycles, Combinatorial Gray codes for classes of pattern avoiding permutations, More restrictive Gray codes for some classes of pattern avoiding permutations, A general exhaustive generation algorithm for Gray structures, Gray code for derangements