The equivalence of two conjectures of Berge and Fulkerson
From MaRDI portal
Publication:3174241
DOI10.1002/jgt.20545zbMath1230.05238OpenAlexW2002091054WikidataQ123244510 ScholiaQ123244510MaRDI QIDQ3174241
Publication date: 12 October 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20545
Related Items (34)
On snarks that are far from being 3-edge colorable ⋮ The cost of perfection for matchings in graphs ⋮ Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture ⋮ On Perfect Matching Coverings and Even Subgraph Coverings ⋮ On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings ⋮ Covering a cubic graph by 5 perfect matchings ⋮ An Upper Bound for the Excessive Index of an r‐Graph ⋮ On excessive index of certain networks ⋮ Covering a cubic graph with perfect matchings ⋮ Graphs of arbitrary excessive class ⋮ Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ On the existence of graphs which can colour every regular graph ⋮ Unions of perfect matchings in \(r\)-graphs ⋮ Some snarks are worse than others ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks ⋮ Generation and properties of snarks ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ Berge-Fulkerson coloring for infinite families of snarks ⋮ Measures of edge-uncolorability of cubic graphs ⋮ On two consequences of Berge–Fulkerson conjecture ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Treelike snarks ⋮ Factorizing regular graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ 1‐Factor and Cycle Covers of Cubic Graphs ⋮ On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph ⋮ Excessive \([l, m\)-factorizations] ⋮ A class of cubic graphs satisfying Berge conjecture
Cites Work
This page was built for publication: The equivalence of two conjectures of Berge and Fulkerson
