Detecting an odd hole
We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Association for Computing Machinery
2020
|