Abstract.
In [6] the author defined a new property of graphs namely the edge-toughness. It was proved in [6] that a 2t-tough graph is always t-edge-tough. It is proved in the present paper that this is not true for (2t−ε)-tough graphs if t is a positive integer. A result of Enomoto et al. in [5] implies that every 2-tough graph has a 2-factor. In the present paper it is proved that every 1-edge-tough graph has a 2-factor. This is a sharpening of the previous statement.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: July 10, 1996 Revised: March 4, 1998
Rights and permissions
About this article
Cite this article
Katona, G. Properties of Edge-Tough Graphs. Graphs Comb 15, 315–325 (1999). https://doi.org/10.1007/s003730050065
Issue Date:
DOI: https://doi.org/10.1007/s003730050065