Countingk-component forests of a graph (Q4022730)
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 98635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Countingk-component forests of a graph |
scientific article; zbMATH DE number 98635 |
Statements
Countingk-component forests of a graph (English)
0 references
17 January 1993
0 references
\(k\)-component spanning forests
0 references
asymptotic time complexity
0 references
matroid duality
0 references
connected spanning unicyclic subgraphs of a planar graph
0 references
0.776304304599762
0 references
0.7756083607673645
0 references
0.7691919803619385
0 references
0.7589441537857056
0 references
