Berge-Fulkerson conjecture on certain snarks

DOI10.1007/s11786-015-0227-zzbMath1317.05153OpenAlexW2269936766WikidataQ123160386 ScholiaQ123160386MaRDI QIDQ2516508

A. S. Shanthi, Paul D. Manuel

Publication date: 3 August 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-015-0227-z

zbMATH Keywords

matchingsnarkperfect matchingexcessive indexBerge-Fulkerson conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Normal 5-edge-colorings of a family of Loupekhine snarks

Cites Work

• Generation and properties of snarks
• Graphs of arbitrary excessive class
• A note on Berge-Fulkerson coloring
• Fulkerson's conjecture and circuit covers
• The excessive [3-index of all graphs]
• On Coloring Problems of Snark Families
• Counting perfect matchings in the geometric dual
• On Fulkerson conjecture
• The equivalence of two conjectures of Berge and Fulkerson
• On minimum sets of 1-factors covering a complete multipartite graph
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• A survey on snarks and new results: Products, reducibility and a computer search
• An Upper Bound for the Excessive Index of an r‐Graph
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Berge-Fulkerson conjecture on certain snarks