Tutte's 5-flow conjecture for highly cyclically connected cubic graphs

DOI10.1016/j.endm.2007.01.032zbMath1293.05196arXivmath/0607077OpenAlexW2177925141WikidataQ123286767 ScholiaQ123286767MaRDI QIDQ5899393

Eckhard Steffen

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics, Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0607077

zbMATH Keywords

flowscubic graphoddnesscubic graphssnarks5-flow conjecturenowhere-zero flowcyclic connectivity5-flowTutte's flow conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (8)

Flows in signed graphs with two negative edges ⋮ Nowhere-zero 5-flows ⋮ Matrix reduction in a combinatorial computation ⋮ Nearly nowhere-zero \(r\)-flow graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Parity subgraphs with few common edges and nowhere-zero 5-flow ⋮ Intersecting 1-factors and nowhere-zero 5-flows ⋮ Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 4

Cites Work

• Nowhere-zero 6-flows
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Restrictions on smallest counterexamples to the 5-flow conjecture
• Balanced Valuations and Flows in Multigraphs
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Tutte's 5-flow conjecture for highly cyclically connected cubic graphs