Translator Disclaimer
May 2016 Outerplanar Coarseness of Planar Graphs
Paul C. Kainen
Missouri J. Math. Sci. 28(1): 97-98 (May 2016). DOI: 10.35834/mjms/1474295359

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

Download 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

Published: May 2016
First available in Project Euclid: 19 September 2016

zbMATH: 1348.05059
MathSciNet: MR3549811
Digital Object Identifier: 10.35834/mjms/1474295359

Subjects:
Primary: 05C10

Rights: Copyright © 2016 Central Missouri State University, Department of Mathematics and Computer Science

JOURNAL ARTICLE
2 PAGES


SHARE
Vol.28 • No. 1 • May 2016
Back to Top