Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four (Q3879265)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
scientific article

    Statements

    Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four (English)
    0 references
    0 references
    1980
    0 references
    0 references
    cycle
    0 references
    Hobbs' conjecture
    0 references
    0 references