Berge-Fulkerson coloring for some families of superposition snarks
From MaRDI portal
Publication:2033883
Recommendations
Cites work
- 1-factor and cycle covers of cubic graphs
- A Contribution to the Theory of Chromatic Polynomials
- A cyclically 6-edge-connected snark of order 118
- A note on Berge-Fulkerson coloring
- Berge-Fulkerson coloring for \(C_{(8)}\)-linked graphs
- Berge-Fulkerson conjecture on certain snarks
- Blocking and anti-blocking pairs of polyhedra
- Construction of class two graphs with maximum vertex degree three
- Construction of permutation snarks
- Covering Graphs by Cycles
- Cycle double covers and non-separating cycles
- Double cycle covers and the petersen graph
- Flows and generalized coloring theorems in graphs
- Fulkerson-covers of hypohamiltonian graphs
- Fulkerson's conjecture and circuit covers
- Generation and properties of snarks
- Graph theory
- scientific article; zbMATH DE number 3884206 (Why is no real title available?)
- scientific article; zbMATH DE number 568843 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 861424 (Why is no real title available?)
- scientific article; zbMATH DE number 867669 (Why is no real title available?)
- scientific article; zbMATH DE number 3102311 (Why is no real title available?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Odd 2-factored snarks
- On a conjecture of Fan and Raspaud
- On Fulkerson conjecture
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Perfect matchings with restricted intersection in cubic graphs
- Polyhedral decompositions of cubic graphs
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
- Reflections on graph theory
- Shortest coverings of graphs with cycles
- Small snarks with large oddness
- Snarks without small cycles
- Sparsely intersecting perfect matchings in cubic graphs
- Superposition and constructions of graphs without nowhere-zero k-flows
- The equivalence of two conjectures of Berge and Fulkerson
- Unique Fulkerson coloring of Petersen minor-free cubic graphs
Cited in
(9)- A note on Berge-Fulkerson coloring
- Berge-Fulkerson coloring for infinite families of snarks
- Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction
- Petersen-colorings and some families of snarks
- Berge-Fulkerson coloring for \(C_{(8)}\)-linked graphs
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs
- Normal 5-edge-coloring of some snarks superpositioned by flower snarks
- Conflict-free incidence coloring of outer-1-planar graphs
This page was built for publication: Berge-Fulkerson coloring for some families of superposition snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033883)
