topology

A graph is planar if it can be embedded into a plane without edges crossings. Related sets include those which restrict the embedding (e.g. geometric intersection graphs), consider other surfaces (e.g. toroid), or allow crossings (e.g. upper bound the total number of crossings).