research

Detecting a long odd hole

Abstract

For each integer t5t\ge 5, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least tt and odd

    Similar works