Planar graph vertex partition for linear problem kernels

► We propose a vertex-partition method for deriving linear kernels for planar graph problems. ► We improve the linear kernel for Connected Vertex Cover on planar graphs from 14k to 4k. ► We improve the linear kernel for Edge Dominating Set on planar graphs from 28k to 12k. ► We improve the linear kernel for Maximum Triangle Packing on planar graphs from 624k to 75k.