Editing to Eulerian graphs

Konrad K. Dabrovski, Petr A. Golovach, Pim van 't Hof and Daniël Paulusma

Journal of Computer and System Sciences, to appear.

A preliminary version of this paper will appear in the proceedings of FSTTCS 2014, the 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (held on December 15-17, 2014 in New Delhi, India), Leibniz International Proceedings in Informatics (LIPIcs), vol. 29, pp. 97-108, 2014.


We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let ea, ed and vd denote the operations edge addition, edge deletion and vertex deletion respectively. For any S ⊆ {ea,ed,vd}, we define Connected Degree Parity Editing(S) (CDPE(S)) to be the problem that takes as input a graph G, an integer k and a function δ : V(G) → {0,1}, and asks whether G can be modified into a connected graph H with dH(v) ≡ δ(v) (mod 2) for each vV(H), using at most k operations from S. We prove that

  1. if S={ea} or S={ea,ed}, then CDPE(S) can be solved in polynomial time;
  2. if {vd} ⊆ S ⊆ {ea,ed,vd}, then CDPE(S) is NP-complete and W-hard when parameterized by k, even if δ ≡ 0.
Together with known results by Cai and Yang and by Cygan, Marx, Pilipczuk, Pilipczuk and Schlotter, our results completely classify the classical and parameterized complexity of the CDPE(S) problem for all S ⊆ {ea,ed,vd}. We obtain the same classification for a natural variant of the CDPE(S) problem on directed graphs, where the target is a weakly connected digraph in which the difference between the in- and out-degree of every vertex equals a prescribed value.

As an important implication of our results, we obtain polynomial-time algorithms for Eulerian Editing problem and its directed variant. To the best of our knowledge, the only other natural non-trivial graph class ℌ for which the ℌ-Editing problem is known to be polynomial-time solvable is the class of split graphs.