On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:51, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs |
scientific article |
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
