1 Answers
In graph theory, a k-outerplanar graph is a planar graph that has a planar embedding in which the vertices belong to at most k {\displaystyle k} concentric layers. The outerplanarity index of a planar graph is the minimum value of k {\displaystyle k} for which it is k {\displaystyle k} -outerplanar.
7 views
Answered