Pages that link to "Item:Q2384578"
From MaRDI portal
The following pages link to A generalized enumeration of labeled trees and reverse Prüfer algorithm (Q2384578):
Displaying 13 items.
- Bijections on rooted trees with fixed size of maximal decreasing subtrees (Q360359) (← links)
- An insertion algorithm and leaders of rooted trees (Q901150) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- Disposition polynomials and plane trees (Q2441620) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees (Q2659064) (← links)
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees (Q2684476) (← links)
- (Q4007094) (← links)
- Enumeration and randomized constructions of hypertrees (Q4973641) (← links)
- A REFINED ENUMERATION OF p-ARY LABELED TREES (Q5016351) (← links)
- A REFINEMENT FOR ORDERED LABELED TREES (Q5863398) (← links)
- The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses (Q6110570) (← links)
- Unit interval parking functions and the \(r\)-Fubini numbers (Q6130359) (← links)
