On a test on switching separability of graphs modulo $q$

Evgeny Bespalov, Denis Krotov

We consider the graphs whose edges are marked by the integers (weights) from $0$ to $q-1$ (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked…