Detecting a Long Odd Hole

Research output: Contribution to journalArticlepeer-review

Abstract

For each integer ℓ ≥ 5, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least ℓ and odd.

Original languageEnglish (US)
JournalCombinatorica
Volume41
Issue number1
DOIs
StatePublished - Feb 2021

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Detecting a Long Odd Hole'. Together they form a unique fingerprint.

Cite this