Graph Planarity

Description

A graph is planar if it’s possible to draw onto a plane with no intersecting edges.

I explained some context for the algorithm here: github.com/mousetail/graphs/blob/…/README.md

Input is given as a comma separated list of edges fore each vertex. Output only the graphs that are planar. Each graph is fully connected and has up to 100 total vertices.