(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:28:35 2004.
HTML page formatted Wed Oct 26 09:47:57 2005.
Cite this as:
Joseph L. Ganley, "planar graph", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/planargraph.html
