Toughness and edge-toughness

Discrete Mathematics

Volumn 164, Issue 1-3, 1997, Pages 187-196

  Katona, Gyula Y ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039380063     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00051-9     Document Type: Article

References (9)

1. D. Bauer, H.J. Broersma, J. van Den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree. Discrete Math. 141 (1995) 1-10.
2. D. Bauer, E. Schmeichel and H.J. Veldman, Cycles in tough graphs - Updating the last four years. Proc. 7th Internat. Conf. on Graph Theory, Combinatorics, Algorithms, and Applications, Kalamazoo, Western Michigan Univ. (1992) to appear.
3. D. Bauer, E. Schmeichel and H.J. Veldman, Toughness and the cycle structure of graphs, Quo Vadis, Graph Theory?, 145-151, Ann. Discrete Math, 55 (1993).
4. V. Chvátal, Tough graphs and hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
5. H. Enomoto, B. Jackson, P. Katerinis and A. Saito, Toughness and the existence of k-factors, J. Graph Theory 9 (1985) 87-95.
6. M.L. Lomonosov, Cycles through prescribed elements in a graph, in: Paths, Flows, and VLSI-layout (Bonn, 1988) 215-234; Algorithms and Combinatorica, Vol. 9 (Springer, Berlin, 1990).
7. M.L. Lomonosov, Cycles through prescribed elements in a graph, in: Paths, Flows, and VLSI-layout (Bonn, 1988) 215-234; Algorithms and Combinatorica, Vol. 9 (Springer, Berlin, 1990).
8. W. Mader Über die Maximalzahl kreuzungsfreier H-Wege, Arch. Math. 31, 387-402.
9. I. Schiermeyer, Hamiltonian cycles in path-tough graphs, Updated Contributions to the Twente Workshop on Hamiltonian Graph Theory, Technical Report, Faculty of Applied Mathematics, University of Twente, The Netherlands (1992) 97-99