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).
Original language | English |
---|---|
Pages (from-to) | 295-297 |
Number of pages | 3 |
Journal | Discrete Mathematics |
Volume | 190 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 1998 |