Almost all 3-connected graphs contain a contractible set of \(k\) vertices (Q1850571)

From MaRDI portal
Revision as of 19:11, 4 June 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
Almost all 3-connected graphs contain a contractible set of \(k\) vertices
scientific article

    Statements

    Almost all 3-connected graphs contain a contractible set of \(k\) vertices (English)
    0 references
    0 references
    10 December 2002
    0 references
    0 references
    connectivity
    0 references
    contractable subgraph
    0 references
    longest induced path
    0 references
    longest cycle
    0 references
    connected subgraph
    0 references
    0 references