Title of article :
The toughness of split graphs
Author/Authors :
Gerhard J. Woeginger، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
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
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
