Given a periodic graph, we wish to determine via combinatorial methods whether it has embeddings in the plane that—via motions that preserve edge-lengths and periodicity—can be continuously deformed into another non-congruent embedding of graph. By introducing NBAC-colourings for corresponding quotient gain graphs, identify which graphs have flexible when lattice periodicity is fixed. We furthe...