When m vertices in a k-connected graph cannot be walked round along a simple cycle (Q1159693)

From MaRDI portal
Revision as of 03:03, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
When m vertices in a k-connected graph cannot be walked round along a simple cycle
scientific article

    Statements

    When m vertices in a k-connected graph cannot be walked round along a simple cycle (English)
    0 references
    0 references
    0 references
    1982
    0 references
    cycles
    0 references

    Identifiers