International audienceWe prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a (Z3^2 × Z9^3)-antisymmetric flow, which improves the bounds obtained by DeVos, Johnson and Seymour, and DeVos, Nesetril and Raspaud
Tutte observed that every nowhere-zero $k$-flow on a plane graph gives rise to a $k$-vertex-coloring...
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow ...
AbstractA nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1,±2,…,±(k−...
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z32 × Z93...
AbstractWe prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z...
AbstractLet G=(V,E) be a directed graph, let M be an abelian group, and let f:E→M be a flow. We say ...
AbstractLet G=(V,E) be a directed graph, let M be an abelian group, and let f:E→M be a flow. We say ...
AbstractWe present a seemingly new definition of flows and flow numbers in oriented matroids and pro...
In this lecture, we establish the connection between nowhere-zero k-flows and nowhere-zero Zk-flows....
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
Tutte observed that every nowhere-zero $k$-flow on a plane graph gives rise to a $k$-vertex-coloring...
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow ...
AbstractA nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1,±2,…,±(k−...
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z32 × Z93...
AbstractWe prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z...
AbstractLet G=(V,E) be a directed graph, let M be an abelian group, and let f:E→M be a flow. We say ...
AbstractLet G=(V,E) be a directed graph, let M be an abelian group, and let f:E→M be a flow. We say ...
AbstractWe present a seemingly new definition of flows and flow numbers in oriented matroids and pro...
In this lecture, we establish the connection between nowhere-zero k-flows and nowhere-zero Zk-flows....
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
Tutte observed that every nowhere-zero $k$-flow on a plane graph gives rise to a $k$-vertex-coloring...
This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow ...
AbstractA nowhere-zero k-flow on a graph Γ is a mapping from the edges of Γ to the set {±1,±2,…,±(k−...
DOI.jpg%3Fwidth%3D300&w=3840&q=75)
Add to ORKG