Graphs with all holes the same length

Linda Cook, Jake Horsfield, Myriam Preissmann +5

A graph is "$\ell$-holed" if all its induced cycles of length at least four have length exactly $\ell$. We give a complete description of the $\ell$-holed graphs for each $\ell\ge…