Extending matchings in graphs: A survey (Q1322235)

From MaRDI portal
Revision as of 14:32, 22 May 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
Extending matchings in graphs: A survey
scientific article

    Statements

    title
    Extending matchings in graphs: A survey (English)
    0 references
    author
    Michael D. Plummer
    0 references
    publication date
    20 October 1994
    0 references
    zbMATH Keywords
    decomposition
    0 references
    matchings
    0 references
    \(t\)-factor
    0 references
    bicritical graphs
    0 references
    \(n\)-extendable
    0 references
    genus
    0 references
    toughness
    0 references
    claw-freedom
    0 references
    degree sums
    0 references
    planar graphs
    0 references
    cites work
    Q5422499
    0 references
    Q5547252
    0 references
    Q4729833
    0 references
    Q4873744
    0 references
    Q4074931
    0 references
    Q4873754
    0 references
    Matching theory
    0 references
    Q5534009
    0 references
    Q5528475
    0 references
    Q5591378
    0 references
    Q3784090
    0 references
    On n-extendable graphs
    0 references
    Q4732491
    0 references
    Q3976637
    0 references
    Q3972523
    0 references
    Q5599567
    0 references
    Q4050646
    0 references
    Q3847965
    0 references

    Identifiers

    zbMATH DE Number
    562637
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1322235&oldid=34124154"
    Powered by MediaWiki