Recognizing tough graphs is NP-hard (Q918697)

From MaRDI portal
Revision as of 01:16, 9 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q61248964, #quickstatements; #temporary_batch_1704755592590)
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
    Wikidata QID
    Q61248964
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q918697&oldid=11823920"
      Powered by MediaWiki