Jaeger et al. conjectured that every 5-edge-connected graph is Z3-connected. In this paper, we prove that every 4-edge-connected K1,3-free graph without any induced cycle of length at least 5 is Z3-connected, which partially generalizes the earlier results of Lai [Graphs and Combin. 16 (2000) 165-176] and Fukunaga...
