Abstract
The (outer) planar coarseness of a graph is the largest number of pairwise-edge-disjoint non-(outer)planar subgraphs. It is shown that the maximum outerplanar coarseness, over all $n$-vertex planar graphs, lies in the interval $\;\big [\lfloor (n-2)/3 \rfloor, \lfloor (n-2)/2 \rfloor \big ]$.
Citation
Paul C. Kainen. "Outerplanar Coarseness of Planar Graphs." Missouri J. Math. Sci. 28 (1) 97 - 98, May 2016. https://doi.org/10.35834/mjms/1474295359
Information