Home » News » seminar » Linda Cook gave a talk on (1) the recognition algorithm for graphs with no long even holes and (2) the structure of graphs with no holes of length≠𝓁 at the Discrete Math Seminar

Linda Cook gave a talk on (1) the recognition algorithm for graphs with no long even holes and (2) the structure of graphs with no holes of length≠𝓁 at the Discrete Math Seminar

On August 17, 2021, Linda Cook from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on (1) a polynomial-time algorithm to detect long even holes and (2) a structure of graphs with no holes of length≠𝓁 for a fixed 𝓁≥7. The title of her talk was “Two results on graphs with holes of restricted lengths“.