Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
From MaRDI portal
Publication:5119221
DOI10.1090/proc/15057zbMath1447.05172OpenAlexW3007987226WikidataQ123145882 ScholiaQ123145882MaRDI QIDQ5119221
Edita Máčajová, Giuseppe Mazzuoccolo
Publication date: 3 September 2020
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/proc/15057
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Girth, oddness, and colouring defect of snarks ⋮ Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Cubic graphs with colouring defect 3 ⋮ Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite generalized quadrangles
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- A note on Berge-Fulkerson coloring
- Fulkerson's conjecture and circuit covers
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Reducible configurations for the cycle double cover conjecture
- Fulkerson's conjecture and Loupekine snarks
- Projective, affine, and abelian colorings of cubic graphs
- On Fulkerson conjecture
- The equivalence of two conjectures of Berge and Fulkerson
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Berge–Fulkerson coloring for C(8)‐linked graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Polyhedral decompositions of cubic graphs
- Blocking and anti-blocking pairs of polyhedra
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
