Editing PlanarGraph
You are currently browsing as guest..
To change this, fill in the following fields:
Username
Password
Click here to reset your password
Who can read this page?
The World
Members
Council
Admin
You have been granted an edit lock on this page
until Fri Apr 26 00:05:05 2024.
Press
to finish editing.
Who can edit this page?
World editing disabled
Members
Council
Admin
In graph theory, a planar graph is a graph which can be embedded in the plane. That is, it can be drawn on the plane so that its edges intersect only at its nodes. (see embedding). Kuratowski's theorem states that a graph is planar if and only if it does not contain a topological EQN:K_5 or EQN:K_{3,3}. Showing that EQN:K_5 and EQN:K_{3,3} are non-planar is fairly easy using the Euler characteristic of the plane /(V+R=E+2)/ but proving the other direction is decidedly awkward.