Abstract
It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. This conjecture has been verified for many families of snarks with small (≤5) cyclic edge-connectivity. An infinite family, denoted by SK, of cyclically 6-edge-connected superposition snarks was constructed in [European J. Combin. 2002] by Kochol. In this paper, the Berge–Fulkerson conjecture is verified for the family SK, and, furthermore, some larger families containing SK. This is the first paper about the Berge–Fulkerson conjecture for superposition snarks and cyclically 6-edge-connected snarks. Tutte’s integer flow and Catlin’s contractible configuration are applied here as the key methods.
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.
