Mikhail Muzychuk, Ilia Ponomarenko
Published 2018-12-15Version 1
Let ${\frak K}$ be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that the isomorphism of any two objects $X,Y\in{\frak K}$ can be tested in polynomial time in sizes of $X$ and $Y$.
Testing Isomorphism of Graphs in Polynomial Time
Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time
![QR code for arXiv:1812.06246 [math.CO]](http://oss.arxitics.com/images/favicon.svg)