Pages that link to "Item:Q260059"
From MaRDI portal
The following pages link to On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059):
Displayed 5 items.
- 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)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← links)
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
