Optimal $\ddot{I}‡$-boundness of $\ell$-holed graphs

Yan Wang, Rong Wu

A graph is {\em{$\ell$-holed}} if all of its induced cycles of length at least four have length exactly $\ell$. In the paper, we prove that if $G$ is an $\ell$-holed graph with odd…