Planar graph bipartization in linear time

For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
• Keywords: Cycle Vertex Transversal, DAM 2008, Linear Time, Planar Graph