The following pages link to On subtrees of trees (Q1775731):
Displayed 16 items.
- Greedy trees, subtrees and antichains (Q396846) (← links)
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- The sum of the distances between the leaves of a tree and the `semi-regular' property (Q539876) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- Enumeration of subtrees of trees (Q861266) (← links)
- Binary trees with the largest number of subtrees (Q868393) (← links)
- The extremal values of the Wiener index of a tree with given degree sequence (Q948686) (← links)
- The inverse problem for certain tree parameters (Q967387) (← links)
- On subtrees of trees (Q1775731) (← links)
- On \(\alpha \)-greedy expansions of numbers (Q2381829) (← links)
- Enumeration problems for classes of self-similar graphs (Q2384571) (← links)
- Extremal values of ratios: distance problems vs. subtree problems in trees. II (Q2436831) (← links)
- Least central subtrees, center, and centroid of a tree (Q3087617) (← links)
- The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)