• Title of article

    Small cycle cover of 2-connected cubic graphs

  • Author/Authors

    Hongjian Lai، نويسنده , , Xiangwen Li، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2003
  • Pages
    8
  • From page
    295
  • To page
    302
  • Abstract
    Every 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycles. This bound is best possible.
  • Keywords
    Cycle cover , Cubic graphs
  • Journal title
    Discrete Mathematics
  • Serial Year
    2003
  • Journal title
    Discrete Mathematics
  • Record number

    949220

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