1 problem

Let $G$ be a graph with a fixed number of directed labellings, where a directed labelling assigns opposite group values to the two orientations of each edge, and call a cycle non-z…