Important:The networks package has been deprecated. Use the superseding command GraphTheory[IsPlanar]instead.

This procedure checks the given graph for planarity.

A copy of the graph G is first simplified by use of gsimp() to remove loops and multiple edges.

The result of the procedure call is true if the resulting simple graph has a planar embedding and false otherwise.

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[isplanar](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$\mathrm{isplanar}\left(\mathrm{petersen}\left(\right)\right)$

$\mathrm{false}$

$\mathrm{isplanar}\left(\mathrm{icosahedron}\left(\right)\right)$

$\mathrm{true}$

$\mathrm{isplanar}\left(\mathrm{complete}\left(5\right)\right)$

$\mathrm{false}$

$\mathrm{isplanar}\left(\mathrm{complete}\left(3\,3\right)\right)$

$\mathrm{false}$