Extremal graphs having no matching cuts (Q3113291)

From MaRDI portal
Revision as of 20:50, 30 August 2023 by Importer (talk | contribs) (‎Created a new 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
    DOI
    10.1002/jgt.20576
    0 references
    author
    Paul Bonsma
    0 references
    Arthur M. Farley
    0 references
    Andrzej Proskurowski
    0 references
    publication date
    8 February 2012
    0 references
    zbMATH DE Number
    6004159
    0 references
    zbMATH Keywords
    matching cut
    0 references
    matching immune
    0 references
    extremal graph
    0 references
    primitive graph
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3113291&oldid=3440950"
      Powered by MediaWiki