• Title of article

    A necessary and sufficient condition for a graph to be edge tenacious

  • Author/Authors

    Zhiping Wang، نويسنده , , Lian-Chang Zhao، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2001
  • Pages
    7
  • From page
    191
  • To page
    197
  • Abstract
    Piazza, Roberts and Stueckle recently conjectured that every complete n-partite graph is strictly edge-tenacious. In this paper, we establish a necessary and sufficient condition for a graph to be edge-tenacious. We apply these results to prove the conjecture of Piazza et al.
  • Keywords
    Edge-sets , Strictly edge-tenacious graph , Edge-tenacious graph , Complete n-partite graph
  • Journal title
    Discrete Mathematics
  • Serial Year
    2001
  • Journal title
    Discrete Mathematics
  • Record number

    949682

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