Yokoi's minimum-degree conjecture for odd edge-colorings

There is a constant $d$ such that every $2$-connected graph $G$ of odd order with minimum degree at least $d$ satisfies

$$\chi'_o(G)\leq 3.$$

Yokoi's conjecture. There exists a constant $d$ satisfying the preceding condition: for every $2$-connected graph $G$ of odd order with minimum degree at least $d$, one has $\chi'_o(G)\leq 3$.

This conjecture is a degree-threshold question for odd edge-colorings of highly connected graphs and is presented as related to the paper's conjecture for $3$-connected graphs. The source gives no resolution.