Enumeration of BC-subtrees of trees

DOI10.1016/J.TCS.2015.02.028MaRDI QIDQ2344772zbMATH OpenOpenAlexFDO

Authors Yu Yang, Hongbo Liu, Hua Wang, Scott Makeig

Publication date 18 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.02.028

zbMATH Keywords

BC-subtreesbicolorable treeblock-cutpoint-treeenumerationextremal treesmiddle part

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Recommendations

• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Subtrees, BC-subtrees of generalized Bethe trees and related questions.
• On different ``middle parts of a tree
• Enumeration of constrained subtrees of trees

Cites work

• An algorithm for the blocks and cutnodes of a graph
• Binary trees with the largest number of subtrees
• Block cutpoint decomposition for markovian queueing systems
• Block-cutvertex trees and block-cutvertex partitions
• Correlation of Graph‐Theoretical Indices
• Coverings of Bipartite Graphs
• Enumeration of subtrees of trees
• Extremal values for ratios of distances in trees
• scientific article; zbMATH DE number 3149610 (Why is no real title available?)
• scientific article; zbMATH DE number 3733966 (Why is no real title available?)
• scientific article; zbMATH DE number 3499785 (Why is no real title available?)
• scientific article; zbMATH DE number 3270498 (Why is no real title available?)
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On finding common subtrees
• On subtrees of trees
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Two flow network simplification algorithms
• Wiener index of trees: Theory and applications

Cited in

(14)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Enumeration of subtrees of planar two-tree networks
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• The number of subtrees of trees with given diameter
• scientific article; zbMATH DE number 5040143 (Why is no real title available?)
• A formula vor vertex cuts in b-trees
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• Subtrees of spiro and polyphenyl hexagonal chains
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• Constant time enumeration of weighted trees

This page was built for publication: Enumeration of BC-subtrees of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344772)