Properties of edge-tough graphs

Graphs and Combinatorics

Volumn 15, Issue 3, 1999, Pages 315-325

  Katona, Gyula Y ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544370368     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050065     Document Type: Article

References (6)

1. Bauer, D., Broersma, H.J., van den Heuvel, J., Veldman, H.J.: Long cycles in graphs with prescribed toughness and minimum degree, Discrete Math 141, 1-10 (1995)
2. Bauer, D., Schmeichel, E., Veldman, H.J.: Cycles in tough graphs - Updating the last four years, to appear in Proc. of the Seventh Int. Conference on Graph Theory, Comb. Algorithms, and Applications, Kalamazoo, Western Michigan University 1992
3. Chvátal, V.: Tough graphs and hamiltonian circuits, Discrete Math. 5, 215-228 (1973)
4. Edmonds, J.: Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards Sect. B69, 125-130 (1965)
5. Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of k-factors, J. Graph Theory 9, 87-95 (1985)
6. Katona, G.Y.: Toughness and edge-toughness, Discrete Math. 164, 187-196 (1997)