• Title of article

    Proofs of Two Minimum Circuit Cover Conjectures

  • Author/Authors

    Fan، نويسنده , , Genghua، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    15
  • From page
    353
  • To page
    367
  • Abstract
    LetGbe a 2-edge-connected graph withmedges andnvertices. The following two conjectures are proved in this paper. (i) The edges ofGcan be covered by circuits of total length at mostm+n−1. (ii) The vertices ofGcan be covered by circuits of total length at most 2(n−1), wheren⩾2.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    1998
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526432

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