Matching and edge-connectivity in graphs with given maximum degree (Q2032857)

From MaRDI portal
Revision as of 23:09, 25 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
Matching and edge-connectivity in graphs with given maximum degree
scientific article

    Statements

    title
    Matching and edge-connectivity in graphs with given maximum degree (English)
    0 references
    author
    Michael A. Henning
    0 references
    Anders Yeo
    0 references
    publication date
    14 June 2021
    0 references
    zbMATH Keywords
    matching number
    0 references
    maximum degree
    0 references
    edge-connectivity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C40
    0 references
    05C07
    0 references
    05C35
    0 references
    05C70
    0 references
    zbMATH DE Number
    7358435
    0 references
    OpenAlex ID
    W3158214365
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2032857&oldid=36690223"
    Powered by MediaWiki