Various results on the toughness of graphs
From MaRDI portal
Publication:4254359
DOI<233::AID-NET9>3.0.CO;2-A 10.1002/(SICI)1097-0037(199905)33:3<233::AID-NET9>3.0.CO;2-AzbMath0923.05035MaRDI QIDQ4254359
E. A. Engbers, H. Trommel, Hajo J. Broersma
Publication date: 29 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<233::aid-net9>3.0.co;2-a
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, Toughness in graphs -- a survey, On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs, Toughness of the corona of two graphs
Cites Work