Two equivalent properties of \(\mathcal Z_3\)-connectivity (Q2637743): Difference between revisions

This paper gives a note on group connectivity of graphs. The author first shows that a graph \(G\) is \(\mathcal{Z}_3\)-connected if and only if \(G\) is 3-flow contractible using the concept of ternary trees. The graph \(G\) obtained from a ternary tree by identifying all its leaves as one new vertex admits a nowhere-zero 3-flow. Then it is proved that a graph \(G\) is \(\mathcal{Z}_3\)-connected if and only if \(G\) admits all generalized Tutte-orientations.