Solution of some multi-dimensional lattice path parity difference recurrence relations (Q1264151): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gray codes with restricted density / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Binary tree gray codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating Trees and Other Combinatorial Objects Lexicographically / rank | |||
Normal rank | |||
Latest revision as of 12:05, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of some multi-dimensional lattice path parity difference recurrence relations |
scientific article |
Statements
Solution of some multi-dimensional lattice path parity difference recurrence relations (English)
0 references
1988
0 references
restricted multiset permutations
0 references
adjacent interchange graph
0 references
recurrence relation
0 references
unrestricted permutations of a multiset
0 references
ordered trees
0 references
prescribed degree sequences
0 references
