Related papers: Nowhere-zero flows in signed series-parallel graph…
We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several different definitions of signed graph colouring.
Tutte's 3-flow conjecture asserts that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. We prove that this conjecture is true for every Cayley graph of valency at least four on any supersolvable group with a noncyclic Sylow…
Lov\'{a}sz et al. proved that every $6$-edge-connected graph has a nowhere-zero $3$-flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3$-flow that extends the flow prescribed on the incident…
Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave like unsigned graphs from the point view of flows. In this…
Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_2$-flow and Seymour's 6-flow theorem asserting that every…
Tutte's $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization…
We give a compact variation of Seymour's proof that every $2$-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_3$-flow.
We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of $Z_3$-, $Z_4$-, and $Z_6$-flows. In the dual setting,…
There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conjecture that every 5-edge-connected graph is $Z_3$-connected and…
Let $G$ be a graph. A zero-sum flow in $G$ is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be naturel number. A zero-sum $k$-flow is a flow with…
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
In 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let $\omega$ be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte's conjecture is equivalent to its restriction to cubic…
In 1972, Tutte posed the $3$-Flow Conjecture: that all $4$-edge-connected graphs have a nowhere zero $3$-flow. This was extended by Jaeger et al.(1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo $3$)…
A triangle-path in a graph $G$ is a sequence of distinct triangles $T_1,T_2,\ldots,T_m$ in $G$ such that for any $i, j$ with $1\leq i < j \leq m$, $|E(T_i)\cap E(T_{i+1})|=1$ and $E(T_i)\cap E(T_j)=\emptyset$ if $j > i+1$. A connected graph…
A set $R\subseteq E(G)$ of a graph $G$ is $k$-removable if $G-R$ has a nowhere-zero $k$-flow. We prove that every graph $G$ admitting a nowhere-zero $4$-flow has a $3$-removable subset consisting of at most $\frac{1}{6}|E(G)|$ edges. This…
We prove that every regular graph of valency at least four whose automorphism group contains a nilpotent subgroup acting transitively on the vertex set admits a nowhere-zero 3-flow.
We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13--28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the r\^ole of circuits is…
We initiate the study of nowhere-zero flow reconfiguration. The natural question is whether any two nowhere-zero $k$-flows of a given graph $G$ are connected by a sequence of nowhere-zero $k$-flows of $G$, such that any two consecutive…
Tutte initiated the study of nowhere-zero flows and proved the following fundamental theorem: For every graph $G$ there is a polynomial $f$ so that for every abelian group $\Gamma$ of order $n$, the number of nowhere-zero $\Gamma$-flows in…
In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tree admitting a nowhere-zero $3$-flow. All these graphs…