We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.

中文翻译：

---

检测奇数孔

我们给出了一个多项式时间算法来测试一个图是否包含一个长度大于三且奇数的诱导循环。