Skip to main content
Log in

Properties of Edge-Tough Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 10, 1996 Revised: March 4, 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050065

Keywords

Navigation