# zbMATH — the first resource for mathematics

On circular perfect two-color colorings. (Russian) Zbl 1249.05119
Summary: We consider perfect colourings of a certain class of infinite graphs called circular graphs. It is shown that every such perfect colouring yields a perfect colouring of an $$n$$-dimensional infinite lattice which has the same parameters as the original colouring. A construction that produces two-colour perfect colourings of circular graphs is proposed and the parameters of perfect colourings given by the construction are enumerated.

##### MSC:
 05C15 Coloring of graphs and hypergraphs
##### Keywords:
perfect colouring; circular graph; equitable partition