Extremal graphs having no matching cuts (Q3113291)

From MaRDI portal
Revision as of 21:59, 4 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
Extremal graphs having no matching cuts
scientific article

    Statements

    title
    Extremal graphs having no matching cuts (English)
    0 references
    author
    Paul Bonsma
    0 references
    Arthur M. Farley
    0 references
    Andrzej Proskurowski
    0 references
    publication date
    8 February 2012
    0 references
    zbMATH Keywords
    matching cut
    0 references
    matching immune
    0 references
    extremal graph
    0 references
    primitive graph
    0 references

    Identifiers

    DOI
    10.1002/jgt.20576
    0 references
    zbMATH DE Number
    6004159
    0 references
    OpenAlex ID
    W1976347563
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3113291&oldid=35264495"
    Powered by MediaWiki