Recognizing tough graphs is NP-hard (Q918697): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61248964, #quickstatements; #temporary_batch_1704755592590 |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Douglas Bauer / rank | |||
Property / author | |||
Property / author: S. Louis Hakimi / rank | |||
Property / author | |||
Property / author: Edward F. Schmeichel / rank | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3689218 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Toughness and the existence ofk-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Maximal Circuits in Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long Cycles in Digraphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90001-s / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981583245 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:49, 30 July 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
tough graphs
0 references