A graph that can be drawn in a plane in such a way that no two edges cross. The complete graph K4, for example, is planar as either drawing of it in the figure shows. Neither the complete graph K5 nor the complete bipartite graph K3,3 is planar. See dual graph, Euler’s Theorem, Kuratowski’s Theorem.
Two planar representations of K4
A graph that can be drawn on paper (with points representing vertices and lines joining vertices representing edges) in such a way that edges intersect only at vertices.
- open economy
- open-ended
- open-ended fund
- open field
- open-field test site
- Open Financial Exchange
- open fold
- open form
- OpenGL
- Open Group
- open hearth process
- open-hearth process
- open hole
- opening prices
- open interval
- open loop control
- open-loop equilibrium
- open-loop gain
- open mapping
- open mapping theorem
- open market operations
- open network
- open outcry
- open-pit mining
- open position