• Title of article

    Contractible Cycles in Graphs with Girth at Least 5

  • Author/Authors

    Egawa، نويسنده , , Yoshimi، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    52
  • From page
    213
  • To page
    264
  • Abstract
    Letk⩾3 be an integer. We show that ifGis ak-connected graph with girth at least 5, thenGhas an induced cycleQsuch thatG−V(Q) is (k−1)-connected.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1998
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526420

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