Solution of some multi-dimensional lattice path parity difference recurrence relations

DOI10.1016/0012-365X(88)90029-5zbMath0689.05007MaRDI QIDQ1264151

D. W. Ko, Frank Ruskey

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

recurrence relationordered treesadjacent interchange graphprescribed degree sequencesrestricted multiset permutationsunrestricted permutations of a multiset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations ⋮ Generating linear extensions of posets by transpositions ⋮ Finding parity difference by involutions

Cites Work

• Gray codes with restricted density
• Some Hamilton Paths and a Minimal Change Algorithm
• Binary tree gray codes
• Efficient generation of the binary reflected gray code and its applications
• Generating Trees and Other Combinatorial Objects Lexicographically