Properties of edge-tough graphs (Q1808717)

The author of the article introduced in [Discrete Math. 164, No. 1-3, 187-196 (1997; Zbl 0874.05035)] the notion of edge-toughness and investigated the relations between edge-toughness and `classical' toughness. In particular, it was proved that every \(2t\)-tough graph is \(t\)-edge-tough. The present paper is the continuation of this research. It is shown that if a graph \(G\) with at least three vertices is 1-edge-tough then \(G\) has a 2-factor. This is a sharpening of a known result of \textit{H. Enomoto, B. Jackson, P. Katarinis}, and \textit{A. Saito} [J. Graph Theory 9, No. 1, 87-95 (1985; Zbl 0598.05054)].