2 problems

Almost equitable factorization conjecture. The graph $G$ can be edge-decomposed into factors $G_1,\ldots,G_k$ such that, for every $v\in V(G)$,

Odd-degree planar edge-partition conjecture. The edges of $G$ can be partitioned into $\tfrac{\Delta-1}{2}$ linear forests and one matching.