On minimally 1-tough $(K_1\cup P_4)$-free graphs

Shiyu Cao, Jing Chen, Wei Zheng

Agraph G is minimally t-tough if the toughness of G is t and the deletion of any edge from G decreases its toughness, where t is a positive real number. It is conjectured that ever…