Depth (Graph)

The depth $E(G)$ of a Graph $G$ is the minimum number of Planar Graphs $P_i$ needed such that the union $\cup_i P_i=G$.

See also Planar Graph