A complete graph with more than four nodes is never planar.
(1) (adj ) Characteristic of a chemical processing technique for silicon-based transistors (2) (adj ) In computer graphics, characteristic of objects within a plane
Any being native to a plane other than the Prime Material Plane These are living beings, not petitioners
A graph is planar if it can be drawn on a plane so that the edges intersect only at the vertices (For example, of the five first complete graphs all but the fifth, K5, is planar )
Contained completely in two dimensions (as, for example, a circle) See also spatial
adj - two-dimensional Thus, a "planar being" is a 2-dimensional being Other dimensions: realmic = 3d, tetral = 4d