The following is a conjecture in graph theory.
Circular Embedding Conjecture. Every 2-connected graph has a circular embedding in some surface.
An embedding of a graph in a surface is circular or strong if every face of the embedding is bounded by a cycle of the graph.
Here is a comment from the Wikipedia article on this conjecture:
If a circular embedding exists, it might not be on a surface of minimal genus: Nguyen Huy Xuong described a 2-vertex-connected toroidal graph none of whose circular embeddings lie on a torus.
The graph is, unfortunately, not presented, but I believe it to be the same one in this article from Cantor's Paradise, which I include below together with its introduction
Interestingly, the genus of a graph is not necessarily the same as the genus required for a strong embedding of a graph. The first example discovered of this phenomenon was provided by the mathematician Nguyen Huy Xuong, and is depicted below.
So far so good. Except this graph admits a cycle double cover consisting of $6$ cycles
Accordingly with the second article, the cycles from a cycle double cover of a 2-connected cubic graph, such as Xuong's, should correspond to the faces of some embedding. But Xuong's graph has $12$ vertices and $18$ edges, so $6$ faces gives us an Euler's characteristic of $0$ and thus a genus of $1$, which is the genus of the graph, as shown by the toroidal embedding above. So what is going on here? Even if it is true Xuong's graph does not have a circular embedding on the torus, doesn't it have a circular embedding on another surface of genus $1$, contradicting the claim the genus of the surface is not minimized?

