2 problems

Seifert-cycle tree conjecture. The graph $\overline{G}(\omega)$ is a tree if and only if $\omega$ is the Gauss code of a closed curve in the plane.

Gauss's conjecture. The interlacement structure of a Gauss code determines whether it has a planar diagram.