A Deterministic Polynomial Kernel for Odd Cycle TransversalResearch Paper
An odd cycle transversal of a finite undirected graph is a set of vertices whose deletion leaves a graph that can be coloured with two colours, with adjacent vertices receiving different colours. The associated decision problem asks whether at most deletions suffice. It is a basic example in parameterized graph algorithms: the graph may be large even when…