Pages that link to "Item:Q616443"

The following pages link to A bijective enumeration of labeled trees with given indegree sequence (Q616443):

Displaying 12 items.

• A recursive algorithm for trees and forests (Q507491) (← links)
• Labeled trees, functions, and an algebraic identity (Q640448) (← links)
• A bijective enumeration of tiered trees (Q776308) (← links)
• Locally oriented noncrossing trees (Q888594) (← links)
• A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (Q913810) (← links)
• Counting labelled trees with given indegree sequence (Q965215) (← links)
• Bijections for a class of labeled plane trees (Q966126) (← links)
• A bijective proof of the Shor recurrence (Q1746570) (← links)
• Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
• A combinatorial approach for discrete car parking on random labelled trees (Q2306005) (← links)
• A generalized enumeration of labeled trees and reverse Prüfer algorithm (Q2384578) (← links)
• Effective divisors on \({\overline{\mathcal{M}}}_g\) associated to curves with exceptional secant planes (Q2428554) (← links)