• Title of article

    The complexity of recognizing tough cubic graphs Original Research Article

  • Author/Authors

    D. Bauer، نويسنده , , J. van den Heuvel، نويسنده , , A. Morgana، نويسنده , , E. Schmeichel، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1996
  • Pages
    10
  • From page
    35
  • To page
    44
  • Abstract
    We show that it is NP-hard to determine if a cubic graph G is 1-tough. We then use this result to show that for any integer t ⩾ 1, it is NP-hard to determine if a 3 t-regular graph is t-tough. We conclude with some remarks concerning the complexity of recognizing certain subclasses of tough graphs.
  • Keywords
    Cubic graphs , NP-completeness , Toughness
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    1996
  • Journal title
    Discrete Applied Mathematics
  • Record number

    884638

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