|
|||||
|
|
The toughness of split graphs |
|
| Authors: | Gerhard J. Woeginger |
| Affiliation: | Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria |
| Abstract: | In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245). |
| Keywords: | Graph algorithm Split graph Toughness Hamiltonian cycle |
| 本文献已被 ScienceDirect 等数据库收录！ | |