Longest cycles in 3-connected graphs contain three contractible edges (Q3815326)

From MaRDI portal
Revision as of 15:40, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Longest cycles in 3-connected graphs contain three contractible edges
scientific article

    Statements

    Longest cycles in 3-connected graphs contain three contractible edges (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    longest path
    0 references
    longest cycles
    0 references
    contractible edges
    0 references
    0 references