Superposition and constructions of graphs without nowhere-zero \(k\)-flows
From MaRDI portal
Publication:1612758
DOI10.1006/eujc.2001.0563zbMath1010.05062OpenAlexW1977492432MaRDI QIDQ1612758
Publication date: 4 September 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2001.0563
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (35)
5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ Modulo orientations and matchings in graphs ⋮ Girth, oddness, and colouring defect of snarks ⋮ Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface ⋮ Three measures of edge-uncolorability ⋮ Approximation of 3-Edge-Coloring of Cubic Graphs ⋮ Matrix reduction in a combinatorial computation ⋮ Tension-flow polynomials on graphs ⋮ Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. ⋮ Snarks and flow-snarks constructed from coloring-snarks. ⋮ Superposition of snarks revisited ⋮ Equivalent versions of group-connectivity theorems and conjectures ⋮ Reductions of Matrices Associated with Nowhere-Zero Flows ⋮ Counterexamples to Jaeger's circular flow conjecture ⋮ On embeddings of snarks in the torus ⋮ Counting nowhere-zero flows on wheels ⋮ Nowhere-zero 3-flows in triangularly connected graphs ⋮ Linear algebraic approach to an edge-coloring result ⋮ Snarks with large oddness and small number of vertices ⋮ Small snarks with large oddness ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven ⋮ Complexity of approximation of 3-edge-coloring of graphs ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces ⋮ Polyhedral embeddings of snarks in orientable surfaces ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ On 3-flow-critical graphs ⋮ Polynomials counting nowhere-zero chains in graphs ⋮ Spanning even subgraphs of 3‐edge‐connected graphs ⋮ Cycle double covers and non-separating cycles ⋮ Decomposition formulas for the flow polynomial ⋮ Polynomials associated with nowhere-zero flows ⋮ About Counterexamples to The 5-Flow Conjecture ⋮ Nowhere-zero -flows on wheels ⋮ Snarks from a Kászonyi perspective: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flows and generalized coloring theorems in graphs
- Construction of class two graphs with maximum vertex degree three
- Nowhere-zero 6-flows
- Some simplified NP-complete graph problems
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- A cyclically 6-edge-connected snark of order 118
- A new proof of Grünbaum's 3 color theorem
- An equivalent version of the 3-flow conjecture
- Five cycle double covers of some cubic graphs
- Snarks without small cycles
- Grötzsch's theorem on 3-colorings
- A Class Of Abelian Groups
- A Minimal Cubic Graph of Girth Seven
- Integer flows
- The NP-Completeness of Edge-Coloring
- Almost all cubic graphs are Hamiltonian
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Hypothetical complexity of the nowhere-zero 5-flow problem
- Indecomposabler-graphs and some other counterexamples
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials
- Stable dominating circuits in snarks
- On 4-connected graphs without even cycle decompositions
This page was built for publication: Superposition and constructions of graphs without nowhere-zero \(k\)-flows
