On perfect colorings of infinite multipath graphs

15 Mar 2020 Lisitsyna M. A. Avgustinovich S. V. Parshina O. G.

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 positive integer... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS