The 3‐connected graphs having a longest cycle containing only three contractible edges (Q4201392)

From MaRDI portal
Revision as of 10:27, 29 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 370422
Language Label Description Also known as
English
The 3‐connected graphs having a longest cycle containing only three contractible edges
scientific article; zbMATH DE number 370422

    Statements

    The 3‐connected graphs having a longest cycle containing only three contractible edges (English)
    0 references
    0 references
    0 references
    0 references
    24 August 1993
    0 references
    3-connected graph
    0 references
    longest cycle
    0 references
    contractible edges
    0 references

    Identifiers

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