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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
