Twofold triple systems with cyclic 2-intersecting Gray codes

Aras Erzurumluoğlu, David A. Pike

Given a combinatorial design $\mathcal{D}$ with block set $\mathcal{B}$, the block-intersection graph (BIG) of $\mathcal{D}$ is the graph that has $\mathcal{B}$ as its vertex set,…