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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-6774(88)90015-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971061054 / rank
 
Normal rank

Latest revision as of 01:38, 20 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
    0 references