Mohar's perfect cross-cap drawing conjecture

Let $G$ be a simple graph. A perfect cross-cap drawing of $G$ is a drawing with $g(G)$ cross-caps in which every edge intersects each cross-cap at most once, where $g(G)$ is the non-orientable genus of $G$. Mohar's perfect drawing conjecture. Every simple graph has a perfect cross-cap drawing. This is the cross-cap formulation of the equality between degenerate crossing number and non-orientable genus; the supplied text gives no resolution status for this conjecture.