Integer flows on triangularly connected signed graphs.

A triangle‐path in a graph G $G$ is a sequence of distinct triangles T1,T2,...,Tm ${T}_{1},{T}_{2},\ldots ,{T}_{m}$ in G $G$ such that for any i,j $i,j$ with 1≤i<j≤m $1\le i\lt j\le m$, ∣E(Ti)∩E(Ti+1)∣=1 $| E({T}_{i})\cap E({T}_{i+1})| =1$ and E(Ti)∩E(Tj)=∅ $E({T}_{i})\cap E({T}_{j})=\varnothing $ if j>i+1 $j\gt i+1$. A connected graph G $G$ is triangularly connected if for any two nonparallel edges e $e$ and e′ $e^{\prime} $ there is a triangle‐path T1T2⋯Tm ${T}_{1}{T}_{2}\cdots {T}_{m}$ such that e∈E(T1) $e\in E({T}_{1})$ and e′∈E(Tm) $e^{\prime} \in E({T}_{m})$. For ordinary graphs, Fan et al. characterize all triangularly connected graphs that admit nowhere‐zero 3‐flows or 4‐flows. Corollaries of this result include the integer flow of some families of ordinary graphs, such as locally connected graphs due to Lai and some types of products of graphs due to Imrich et al. In this paper, Fan's result for triangularly connected graphs is further extended to signed graphs. We proved that a flow‐admissible triangularly connected signed graph admits a nowhere‐zero 4‐flow if and only if it is not the wheel W5 ${W}_{5}$ associated with a specific signature. Moreover, this result is sharp since there are infinitely many unbalanced triangularly connected signed graphs admitting a nowhere‐zero 4‐flow but no 3‐flow. [ABSTRACT FROM AUTHOR]