BabelNet

bn:01773256n

Noun Concept

Categories: Planar graphs, Intersection classes of graphs, Graph families

planar graph Convex plane graph Kuratowski's reduction theorem maximal planar graph nonplanar

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. Wikipedia

Definitions

Relations

Sources

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. Wikipedia

Graph that can be drawn in the plane so that no edges cross Wikipedia Disambiguation

Graph that can be embedded in the plane Wikidata

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. Wiktionary

IS A

HAS KIND