Recognizing tough graphs is NP-hard.

Mon, 01 Jan 1990 00:00:00 +0100

Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28(3): 191-195 (1990)