The complexity of recognizing tough cubic graphs (Q1372728)

From MaRDI portal
Revision as of 16:07, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The complexity of recognizing tough cubic graphs
scientific article

    Statements

    title
    The complexity of recognizing tough cubic graphs (English)
    0 references
    author
    Douglas Bauer
    0 references
    Jan van den Heuvel
    0 references
    Aurora Morgana
    0 references
    Edward F. Schmeichel
    0 references
    publication date
    7 January 1998
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C38
    0 references
    05C45
    0 references
    zbMATH DE Number
    1088851
    0 references
    zbMATH Keywords
    cubic graphs
    0 references
    NP-completeness
    0 references
    tough graphs
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1372728&oldid=13517128"
    Powered by MediaWiki