Pages that link to "Item:Q3174241"
From MaRDI portal
The following pages link to The equivalence of two conjectures of Berge and Fulkerson (Q3174241):
Displaying 34 items.
- On snarks that are far from being 3-edge colorable (Q281587) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- On excessive index of certain networks (Q391312) (← links)
- Covering a cubic graph with perfect matchings (Q393450) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Graphs of arbitrary excessive class (Q616357) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Treelike snarks (Q727053) (← links)
- On the excessive \([m]\)-index of a tree (Q741745) (← links)
- Perfect matching covers of cubic graphs of oddness 2 (Q1732040) (← links)
- Berge-Fulkerson coloring for infinite families of snarks (Q1734033) (← links)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- A class of cubic graphs satisfying Berge conjecture (Q2117532) (← links)
- Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction (Q2245053) (← links)
- Factorizing regular graphs (Q2284748) (← links)
- On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph (Q2342641) (← links)
- Excessive \([l, m]\)-factorizations (Q2352055) (← links)
- Covering a cubic graph by 5 perfect matchings (Q2397531) (← links)
- Berge-Fulkerson conjecture on certain snarks (Q2516508) (← links)
- Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture (Q2636823) (← links)
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
- On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195) (← links)
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223) (← links)
- On Perfect Matching Coverings and Even Subgraph Coverings (Q3466356) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks (Q5119221) (← links)
- On two consequences of Berge–Fulkerson conjecture (Q5154629) (← links)
- An Upper Bound for the Excessive Index of an <i>r</i>‐Graph (Q5325949) (← links)
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs (Q6056765) (← links)
- Ban–Linial's Conjecture and treelike snarks (Q6057640) (← links)
- On the existence of graphs which can colour every regular graph (Q6162043) (← links)
- Unions of perfect matchings in \(r\)-graphs (Q6172292) (← links)
- Some snarks are worse than others (Q6181999) (← links)
