For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。
