Noun
planar graph (plural planar graphs) (graph theory) A graph which can be embedded in a plane in such a way that its edges only intersect at vertices, i.e., they do not cross each other.