• Title of article

    Fulkersonʼs Conjecture and Loupekine snarks

  • Author/Authors

    Karam، نويسنده , , Kaio and Campos، نويسنده , , C.N.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2013
  • Pages
    6
  • From page
    333
  • To page
    338
  • Abstract
    Fulkersonʼs Conjecture says that every bridgeless cubic graph has six perfect matchings such that each edge belongs to exactly two of them. In 1976, F. Loupekine created a method for constructing new snarks from already known ones. We consider an infinite family of snarks built with Loupekineʼs method, and verify Fulkersonʼs Conjecture for this family.
  • Keywords
    Fulkerson?s Conjecture , Snarks , Loupekine snarks , Matchings , edge-colourings
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2013
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1456478

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