Block-cutvertex trees and block-cutvertex partitions
From MaRDI portal
Publication:1849911
DOI10.1016/S0012-365X(01)00461-7zbMath1010.05020OpenAlexW2024684573MaRDI QIDQ1849911
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00461-7
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
A bound on the dissociation number ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ Distance labeling scheme and split decomposition ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ Enumeration of BC-subtrees of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
This page was built for publication: Block-cutvertex trees and block-cutvertex partitions
