论文信息 - Toughness and edge-toughness

Toughness and edge-toughness

We generalize the definition of toughness and define a new property of graphs, the egdetoughness. In this new definition edges are also allowed to be deleted besides vertices. A number of results are given on the relation of toughness and edge-toughness.

Gyula Y. Katona

[1] W. Mader. Über die Maximalzahl kreuzungsfreierH-Wege , 1978 .

[2] Douglas Bauer,et al. Long cycles in graphs with prescribed toughness and minimum degree , 1995, Discret. Math..

[3] Edward F. Schmeichel,et al. Cycles in tough graphs- updating the last four years , 1995 .

[4] Alexander Schrijver,et al. Paths, Flows, and VLSI-Layout , 1990 .

[5] Hikoe Enomoto,et al. Toughness and the existence of k-factors , 1985, J. Graph Theory.

[6] Edward F. Schmeichel,et al. Toughness and the Cycle Structure of Graphs , 1993 .

[7] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[8] Henk Jan Veldman,et al. Updated contributions to the Twente Workshop on Hamiltonian Graph Theory , 1992 .