Odd Cycle Transversal on $H$-free graphs

Esther Galby, Paloma T. de Lima, Andrea Munaro +1

\textsc{Odd Cycle Transversal} is a classic $\mathsf{NP}$-hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite…