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 the normal view instead:
scientific article; zbMATH DE number 6558420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8172120451927185
0 references
0.8048658967018127
0 references
0.7886775135993958
0 references
0.7394493818283081
0 references
0.7347512245178223
0 references
