The toughness of split graphs

G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    20 Citations (Scopus)


    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 languageEnglish
    Pages (from-to)295-297
    Number of pages3
    JournalDiscrete Mathematics
    Issue number1-3
    Publication statusPublished - 1998


    Dive into the research topics of 'The toughness of split graphs'. Together they form a unique fingerprint.

    Cite this