Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs (Q3825103)

From MaRDI portal
Revision as of 02:38, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
scientific article

    Statements

    Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs (English)
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3-connected graph
    0 references
    spanning trees
    0 references
    ear decomposition
    0 references
    nonseparating induced cycle
    0 references
    0 references