The complexity of recognizing tough cubic graphs Original Research Article

We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to show that for any integer t ⩾ 1, it is NP-hard to determine if a 3 t-regular graph is t-tough. We conclude with some remarks concerning the complexity of recognizing certain subclasses of tough graphs.