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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Alexander K. Kelmans / rank
Normal rank
 
Property / author
 
Property / author: Q585079 / rank
Normal rank
 

Revision as of 16:01, 28 February 2024

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
    1982
    0 references
    cycles
    0 references

    Identifiers