NIST

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 graph in the plane such that no edges cross (C, C++, Java, 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 November 2020.
HTML page formatted Wed Oct 30 12:15:31 2024.

Cite this as:
Joseph L. Ganley, "planar graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 November 2020. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/planargraph.html