The following pages link to The toughness of cubic graphs (Q1911237):
Displaying 7 items.
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (Q1889826) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- On the Toughness of Cycle Permutation Graphs (Q2760959) (← links)
- (Q3707421) (← links)
- (Q4405925) (← links)
- Toughness, minimum degree, and spanning cubic subgraphs (Q4458596) (← links)