Jaeger's strong embedding conjecture for 2-connected graphs

Let $\Gamma$ be a $2$-connected graph. A strong embedding is an embedding of a graph in a surface in which every facial walk is simple. Jaeger's strong embedding conjecture. Every $2$-connected graph $\Gamma$ has a strong embedding in some orientable surface. The conjecture has been verified for $2$-connected projective-planar cubic graphs, but remains open in general.