On the existence of minimally tough graphs having large minimum degrees

Morteza Hasanvand

Kriesel conjectured that every minimally $1$-tough graph has a vertex with degree precisely $2$. Katona and Varga (2018) proposed a generalized version of this conjecture which say…