Countingk-component forests of a graph (Q4022730)

From MaRDI portal
Revision as of 14:14, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Countingk-component forests of a graph
scientific article

    Statements

    Countingk-component forests of a graph (English)
    0 references
    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 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references