Minimal toughness in subclasses of weakly chordal graphs

J. Pascal Gollin, Martin Milanič, Laura Ogrin

The toughness of a graph $G$ is defined as the largest real number $t$ such that for any set $S\subseteq V(G)$ such that $G-S$ is disconnected, $S$ has at least $t$ times more elem…