Pages that link to "Item:Q868393"

The following pages link to Binary trees with the largest number of subtrees (Q868393):

Displaying 7 items.

• Generating and enumerating digitally convex sets of trees (Q295254) (← links)
• The number of maximum matchings in a tree (Q409365) (← links)
• The minimal number of subtrees with a given degree sequence (Q489367) (← links)
• Extremal problems for trees with given segment sequence (Q507572) (← links)
• Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
• On the eccentric subtree number in trees (Q827611) (← links)
• The shape of node reliability (Q1701111) (← links)