NP-completeness of some problems of partitioning and covering in graphs (Q794673)

The author proves that the following problems are NP-complete: 1) Given a non-symmetric digraph G such that \(d^+(x)=d^-(x)=2\) for all \(x\in V(G)\), can A(X) be partitioned into two Hamilton circuits? 2) Given a digraph G such that \(d^+(x)=d^-(x)=2\) for all \(x\in V(G)\), can A(X) be partitioned into two anti-directed Hamilton circuits? 3) Let G be a graph with maximum degree 4. Can E(G) be partitioned into two paths? Can E(G) be covered by two paths? 4) Let G be a digraph such that \(d^+(x)\leq 2\) and \(d^-(x)\leq 2\) for all \(x\in V(G)\). Can A(X) be partitioned into two paths? Can A(X) be partitioned into two anti- directed paths? Can A(X) be covered by two paths?