Pages that link to "Item:Q3902521"
From MaRDI portal
The following pages link to Listing and Counting Subtrees of a Tree (Q3902521):
Displayed 9 items.
- Listing and counting subtrees of equal size of a binary tree (Q1055196) (← links)
- Alternating Whitney sums and matchings in trees. 1 (Q1105614) (← links)
- Gray codes from antimatroids (Q1318347) (← links)
- On the average number of nodes in a subtree of a tree (Q1838491) (← links)
- Hilbert series in the category of trees with contractions (Q2043099) (← links)
- Enumeration problems for classes of self-similar graphs (Q2384571) (← links)
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
- On the Position Value for Special Classes of Networks (Q4687455) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)