1 problem

Grünbaum's conjecture. Every planar 3-connected graph $G$ contains a 3-tree $T$ whose co-tree $\neg T^*$ is also a 3-tree.