Pages that link to "Item:Q1606919"
From MaRDI portal
The following pages link to Loopless generation of Gray codes for \(k\)-ary trees (Q1606919):
Displaying 7 items.
- A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
- On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
- Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
- A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
