M. A. Lisitsyna

collaborators

2 papers

math.CO2020

On perfect colorings of infinite multipath graphs

M. A. Lisitsyna, S. V. Avgustinovich, O. G. Parshina

A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius $1$ in the graph depends only on the color of the ball center. Let $n$ be a…

math.CO2019

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…