maximal planar graph

maximal planar graph

[′mak·sə·məl ¦plān·ər ‚graf]
(mathematics)
A planar graph to which no new arcs can be added without forcing crossings and hence violating planarity.
References in periodicals archive ?
It was presented in 1972 as an example of a maximal planar nontraceable graph of smallest order by Goodey [7], who also proved that every maximal planar graph of order less than 14 is traceable.
In a maximal planar graph G = ((V (G), E(G)) with [absolute value of V (G)]=n and [absolute value of E (G)]=m, we have m = 3n - 6.
Full browser ?