• Title of article

    The toughness of split graphs

  • Author/Authors

    Gerhard J. Woeginger، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    3
  • From page
    295
  • To page
    297
  • 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
  • Serial Year
    1998
  • Journal title
    Discrete Mathematics
  • Record number

    951167

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=951167