 Planar cover

In graph theory, a planar cover of a finite graph "G" is a finite covering graph of "G" that is itself a planar graph.Every graph that can be embedded into the projective plane has a planar cover; an unsolved conjecture of Seiya Negami states that these are the only graphs with planar covers.