Finding parity difference by involutions

DOI10.1016/0012-365X(95)00339-XzbMath0873.05002WikidataQ127754149 ScholiaQ127754149MaRDI QIDQ1356534

Grzegorz Stachowiak

Publication date: 8 October 1997

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

zbMATH Keywords

multiset permutationgeneration algorithmcolour classesgeneration of treescombinatorial objectslinear extensions of posetshamitonian pathminimal change generating algorithmminimal change graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gray codes with restricted density
• Counting linear extensions
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Generating linear extensions of posets by transpositions
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• Efficient generation of the binary reflected gray code and its applications
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Finding parity difference by involutions