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

DOI10.1016/0012-365X(88)90029-5zbMATH Open0689.05007MaRDI QIDQ1264151FDOQ1264151

Authors: D. W. Ko, Frank Ruskey 

Publication date: 1988

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

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

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)

Cites Work

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

Cited In (6)

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

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)