Toughness of recursively partitionable graphs

Calum Buchanan, Brandon Du Preez, K. E. Perry +1

A simple graph $G=(V,E)$ on $n$ vertices is said to be recursively partitionable (RP) if $G\simeq K_1$, or if $G$ is connected and satisfies the following recursive property: for…