Tutte's $3$-Flow Conjecture in $3$-tree-connected graphs

Morteza Hasanvand

Tutte's $3$-flow conjecture says that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. Kochol (2001) showed that it is enough to prove this conjecture for $5$-edge-co…