✳flâneur — a map of the web's best reading

Planar graph

en.wikipedia.org · 5,128 words · saved by 1 readers

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. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.

Planar graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia "Triangular graph" redirects here. For line graphs of complete graphs, see Line graph § Strongly regular and perfect line graphs . For triangulated graphs, see Chordal graph . For data graphs plotted across three variables, see Ternary plot . Graph that can be embedded in the plane Example graphs Planar Nonplanar Butterfly graph Complete graph K 5 Complete graph K 4 Utility graph K 3,3 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 tha

Explore this link on the map →

related reading