Official title and information are available only for Plus and Premium subscribers.
Patent Granted In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.[1] Such a drawing is called a plane graph or planar embedding of the graph.
To see the additional information details please login and subscribe to a Plus or Premium account.
