A graph is planar if the graph can be embedded in the plane, i.e., the vertices can be arranged such that no edges cross except at vertices.
i1 : R = QQ[a..e]; |
i2 : isPlanar cycle R o2 = true |
i3 : isPlanar completeGraph R o3 = false |
This method uses the program planarg. The code was written by Paulette Lieby for the Magma project and used with permission in the software nauty.
The object isPlanar is a method function.