3 problems

Dymacek–Bailey conjecture. There is only one regular Steinhaus graph of odd degree, the complete graph

Dymacek's conjecture. The regular Steinhaus graphs of even degree are the zero-edge graph on $n$ vertices, for all positive integers $n$, and the Steinhaus graph $G(s)$ on $n=3m+1$…

Dymacek's conjecture. The complete graph on two vertices $K_2$ is the only regular Steinhaus graph of odd degree.