Kernelization of edge perfect code and its variants

We show that the three problems Edge Perfect Code, Edge Weakly-Perfect Code, and Edge Semi-Perfect Code  are all fixed-parameter tractable (with the solution size k as parameter) by obtaining various kernelization results. In general graphs, Edge Perfect Code  admits a problem kernel with O(k2) vertices and O(k3) edges, Edge Weakly-Perfect Code  admits a problem kernel with O(k3) vertices and O(k3) edges, and Edge Semi-Perfect Code  admits a problem kernel with O(2k⋅k) vertices and O(2k⋅k) edges. In planar graphs and in graphs without small cycles or large stars, the kernel sizes for the three problems can be significantly reduced, to O(k2) and in some cases even to O(k). On the other hand, all three problems remain NP-complete in grid graphs of maximum degree 3 and arbitrarily large girth. Moreover, Edge Semi-Perfect Code  does not admit any polynomial kernel in bipartite graphs unless NP ⊆ coNP/poly.