Baudon–Bensmail–Przybyło–Woźniak conjecture on the irregular chromatic index

Let $G$ be a finite simple graph that admits an edge-decomposition into locally irregular subgraphs; such a graph is called decomposable, and let $\chi'_{\rm irr}(G)$ be the least number of parts in such a decomposition.

Baudon–Bensmail–Przybyło–Woźniak conjecture. For every decomposable graph $G$,

$$\chi'_{\rm irr}(G)\leq 3.$$

The conjecture asserts a constant bound on the number of locally irregular subgraphs needed to decompose any graph for which such a decomposition exists. The supplied text does not state whether it has been resolved.