Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100)

From MaRDI portal
Revision as of 12:29, 13 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
Algorithmic proofs of two relations between connectivity and the 1- factors of a graph
scientific article

    Statements

    title
    Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (English)
    0 references
    author
    Harold N. Gabow
    0 references
    publication date
    1979
    0 references
    zbMATH DE Number
    3724502
    0 references
    zbMATH Keywords
    matched graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1153100&oldid=34652714"
    Powered by MediaWiki