A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar graphs have at most 4n - 8 edges. We show that there are sparse maximal 1-planar graphs with only 45/17n + O(1) edges. With a fixed rotation system there are maximal 1-planar graphs with only 7/3n + O(1) edges. This is sparser than maximal planar graphs. There cannot be maximal 1-planar graphs with less than 21/10n - O(1) edges and less 28/13n - O(1) than edges with a fixed rotation system. Furthermore, we prove that a maximal 1-planar rotation system of a graph uniquely determines its 1-planar embedding. © 2013 Springer-Verlag.
CITATION STYLE
Brandenburg, F. J., Eppstein, D., Gleißner, A., Goodrich, M. T., Hanauer, K., & Reislhuber, J. (2013). On the density of maximal 1-planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7704 LNCS, pp. 237–338). https://doi.org/10.1007/978-3-642-36763-2_29
Mendeley helps you to discover research relevant for your work.