Smallest counterexample to the 5-flow conjecture has girth at least eleven
From MaRDI portal
Publication:974466
DOI10.1016/J.JCTB.2009.12.001zbMATH Open1211.05055OpenAlexW2003279860MaRDI QIDQ974466FDOQ974466
Publication date: 3 June 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.12.001
Recommendations
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- Snarks without small cycles
- Title not available (Why is that?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- A Class Of Abelian Groups
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Restrictions on smallest counterexamples to the 5-flow conjecture
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- A cyclically 6-edge-connected snark of order 118
- Counting nowhere-zero flows on wheels
- Matrix reduction in a combinatorial computation
- Decomposition formulas for the flow polynomial
Cited In (10)
- Counting nowhere-zero flows on wheels
- Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
- The Chvátal-Erdős condition for group connectivity in graphs
- Flow-Critical Graphs
- Matrix reduction in a combinatorial computation
- Nowhere-zero 5-flows
- Measures of edge-uncolorability of cubic graphs
- Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4
- Avoiding 5-Circuits in 2-Factors of Cubic Graphs
- About Counterexamples to The 5-Flow Conjecture
This page was built for publication: Smallest counterexample to the 5-flow conjecture has girth at least eleven
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974466)
