Recognizing tough graphs is NP-hard (Q918697)

From MaRDI portal
Revision as of 11:17, 7 July 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
Recognizing tough graphs is NP-hard
scientific article

    Statements

    title
    Recognizing tough graphs is NP-hard (English)
    0 references
    author
    Douglas Bauer
    0 references
    S. Louis Hakimi
    0 references
    Edward F. Schmeichel
    0 references
    publication date
    1990
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C45
    0 references
    zbMATH DE Number
    4160130
    0 references
    zbMATH Keywords
    tough graphs
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q918697&oldid=1192088"
      Powered by MediaWiki