The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances

O. G. Parshina, M. A. Lisitsyna

A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots ,k\}$. A coloring is called pe…