Definition: A graph that can be drawn in the plane with no crossing edges.
Generalization (I am a kind of ...)
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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Joseph L. Ganley, "planar graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/planargraph.html