Decomposing planar graphs into graphs with degree restrictions

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +3

Given a graph $G$, a decomposition of $G$ is a partition of its edges. A graph is $(d,h)$-decomposable if its edge set can be partitioned into a $d$-degenerate graph and a graph w…