Skip to main navigation Skip to search Skip to main content

Berge–Fulkerson Conjecture on Certain Snarks

  • Paul Manuel
  • , A. S. Shanthi*
  • *Corresponding author for this work
  • Department of Mathematics
  • Stella Maris College

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. The Berge–Fulkerson conjecture proposed in 1971 states that every bridgeless cubic graph contains a family of six perfect matchings such that each edge is contained in exactly two of them. This conjecture holds trivialy for 3-edge colorable graphs. Thus a possible minimum counterexample for the conjecture is a snark. In this paper we shown that the conjecture holds for families of snarks such as Loupekhine snarks of first and second kind and the Watkins snark. We also determine the excessive index for Loupekhine snarks of first and second kind.

Original languageEnglish
Pages (from-to)209-220
Number of pages12
JournalMathematics in Computer Science
Volume9
Issue number2
DOIs
StatePublished - 15 Jun 2015

Keywords

  • Berge–Fulkerson conjecture
  • Excessive Index
  • Matching
  • Perfect matching
  • Snark

Fingerprint

Dive into the research topics of 'Berge–Fulkerson Conjecture on Certain Snarks'. Together they form a unique fingerprint.

Cite this