Properties of minimally $t$-tough graphs

Gyula Y. Katona, Dániel Soltész, Kitti Varga

A graph $G$ is minimally $t$-tough if the toughness of $G$ is $t$ and the deletion of any edge from $G$ decreases the toughness. Kriesell conjectured that for every minimally $1$-t…