Pages that link to "Item:Q1937356"

The following pages link to Trees with the mos subtrees - an algorithmic approach (Q1937356):

Displaying 15 items.

• Greedy trees, subtrees and antichains (Q396846) (← links)
• The minimal number of subtrees of a tree (Q489363) (← links)
• The minimal number of subtrees with a given degree sequence (Q489367) (← links)
• The distances between internal vertices and leaves of a tree (Q740265) (← links)
• Enumeration of subtrees of trees (Q861266) (← links)
• On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
• On the number of connected subgraphs of graphs (Q2243091) (← links)
• Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
• Enumeration of constrained subtrees of trees (Q2364868) (← links)
• Largest Number of Subtrees of Trees with a Given Maximum Degree (Q3394983) (← links)
• Maximizing the mean subtree order (Q5229538) (← links)
• The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
• Trees with large numbers of subtrees (Q5737871) (← links)
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)