Integer flows on triangularly connected signed graphs

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 $G$ is triangularly connected if for any two nonparallel ed... View More