On the density of maximal 1-planar graphs

  • Authors:

  • Franz J. Brandenburg;David Eppstein;Andreas Gleißner;Michael T. Goodrich;Kathrin Hanauer;Josef Reislhuber

  • Affiliations:

  • University of Passau, Passau, Germany;Department of Computer Science, University of California, Irvine;University of Passau, Passau, Germany;Department of Computer Science, University of California, Irvine;University of Passau, Passau, Germany;University of Passau, Passau, Germany

  • Venue:
  • GD'12 Proceedings of the 20th international conference on Graph Drawing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 $\frac{45}{17} n + \mathcal{O}(1)$ edges. With a fixed rotation system there are maximal 1-planar graphs with only $\frac{7}{3} n + \mathcal{O}(1)$ edges. This is sparser than maximal planar graphs. There cannot be maximal 1-planar graphs with less than $\frac{21}{10} n - \mathcal{O}(1)$ edges and less than $\frac{28}{13} n - \mathcal{O}(1)$ 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.