Pages that link to "Item:Q2235776"
From MaRDI portal
The following pages link to Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776):
Displaying 11 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
- Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- Enumeration of constrained subtrees of trees (Q2364868) (← links)
- Subtrees, BC-subtrees of generalized Bethe trees and related questions. (Q2822811) (← links)
- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application (Q2914339) (← links)
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices (Q6064850) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
