# planar graph

(definition)

**Definition:**
A *graph* that can be drawn in the plane with no crossing *edges*.

**Generalization** (I am a kind of ...)

*graph*.

**Specialization** (... is a kind of me.)

*dual*, *planar straight-line graph*.

*Note:
Equivalently, a graph that does not contain any subgraph **homeomorphic* to the *complete graph* on 5 *vertices* or the complete *bipartite graph* with 3 vertices in each partition.

Author: JLG

## Implementation

draw a planar graph such that no edges cross (C, C++, and Mathematica)

Go to the
Dictionary of Algorithms and Data
Structures home page.

If you have suggestions, corrections, or comments, please get in touch
with Paul Black.

Entry modified 2 September 2014.

HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:

Joseph L. Ganley, "planar graph", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/planargraph.html