Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov +3

An independent set in a graph G is a set of pairwise non-adjacent vertices. A graph $G$ is bipartite if its vertex set can be partitioned into two independent sets. In the Odd Cycl…