Toughness in graphs - A survey

Bauer, Douglas and Broersma, Hajo and Schmeichel, Edward (2006) Toughness in graphs - A survey. Graphs and Combinatorics, 22 (1). pp. 1-35. ISSN 0911-0119

PDF
Restricted to UT campus only: Request a copy
226Kb

Abstract:	In this survey we have attempted to bring together most of the results and papers that deal with toughness related to cycle structure. We begin with a brief introduction and a section on terminology and notation, and then try to organize the work into a few self explanatory categories. These categories are circumference, the disproof of the 2-tough conjecture, factors, special graph classes, computational complexity, and miscellaneous results as they relate to toughness. We complete the survey with some tough open problems!
Item Type:	Article
Copyright:	© 2006 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/63724
Official URL:	http://dx.doi.org/10.1007/s00373-006-0649-0
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Repository Staff Only: item control page

Metis ID: 237666