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

DOI10.1016/0012-365X(88)90029-5MaRDI QIDQ1264151zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4128814
• Finding parity difference by involutions
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• A Note on Multiset Permutations
• Enumerative combinatorics of prographs

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 4128814 (Why is no real title available?)
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Finding parity difference by involutions
• Difference Equations and Generating Functions for some Lattice Path Problems
• Generating linear extensions of posets by transpositions

This page was built for publication: Solution of some multi-dimensional lattice path parity difference recurrence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264151)