On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs |
scientific article; zbMATH DE number 6558420
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs |
scientific article; zbMATH DE number 6558420 |
Statements
On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (English)
0 references
18 March 2016
0 references
block-cutpoint-tree
0 references
BC-subtrees
0 references
unicyclic graphs
0 references
edge-disjoint bicyclic graphs
0 references
generating function
0 references
enumeration
0 references
0 references
0 references
0 references
