Detecting a long even hole
Abstract
For each integer ≥ 4, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least and even
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.