• Title of article

    Fragments in 2-Critically n-Connected Graphs

  • Author/Authors

    Su، نويسنده , , J.J.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1993
  • Pages
    11
  • From page
    269
  • To page
    279
  • Abstract
    Mader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwise disjoint fragments. The conjecture was verified by Mader for k = 1. In this paper, we prove that this conjecture holds also for k = 2.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1993
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1525764

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