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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 12:53, 5 March 2024

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
    3-connected graph
    0 references
    spanning trees
    0 references
    ear decomposition
    0 references
    nonseparating induced cycle
    0 references

    Identifiers

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