Recognizing tough graphs is NP-hard (Q918697): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Douglas Bauer / rank
 
Normal rank
Property / author
 
Property / author: S. Louis Hakimi / rank
 
Normal rank
Property / author
 
Property / author: Edward F. Schmeichel / rank
 
Normal rank

Revision as of 16:51, 12 February 2024

scientific article
Language Label Description Also known as
English
Recognizing tough graphs is NP-hard
scientific article

    Statements

    Recognizing tough graphs is NP-hard (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    tough graphs
    0 references
    0 references
    0 references
    0 references
    0 references