On Distance-3 Matchings and Induced Matchings (Q3655145)

From MaRDI portal
Revision as of 08:51, 2 July 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
On Distance-3 Matchings and Induced Matchings
scientific article

    Statements

    title
    On Distance-3 Matchings and Induced Matchings (English)
    0 references
    author
    Andreas Brandstädt
    0 references
    Raffaele Mosca
    0 references
    publication date
    7 January 2010
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5654173
    0 references
    zbMATH Keywords
    Distance-\(k\) matching
    0 references
    chordal graphs
    0 references
    Maximum Distance-\(k\) Matching Problem
    0 references
    Maximum Induced Matching Problem
    0 references
    OpenAlex ID
    W2155233937
    0 references
    cites work
    Induced matchings
    0 references
    Q5463350
    0 references
    Q3416248
    0 references
    Q3222876
    0 references
    Q3139292
    0 references
    Q3328583
    0 references
    Q3683903
    0 references
    On induced matchings
    0 references
    Q3686753
    0 references
    Q4500845
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3655145&oldid=35145763"
    Powered by MediaWiki