Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture

DOI10.1016/j.jctb.2014.02.012zbMath1297.05102OpenAlexW2065274214WikidataQ56926543 ScholiaQ56926543MaRDI QIDQ740648

Carsten Thomassen

Publication date: 4 September 2014

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.2014.02.012

zbMATH Keywords

group floworientations modulo \(k\)\((2+\epsilon)\)-flow conjectureunit vector flow

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Flows in graphs (05C21)

Related Items (6)

Vector Flows and Integer Flows ⋮ Graph factors modulo \(k\) ⋮ On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph ⋮ Algebraic flow theory of infinite graphs ⋮ Factorizing regular graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Shortest coverings of graphs with cycles
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• An equivalent version of the 3-flow conjecture
• On the Problem of Decomposing a Graph into n Connected Factors
• Integer flows
• A Reduction Method for Edge-Connectivity in Graphs
• Blocking and anti-blocking pairs of polyhedra
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture