Advertisement

On Sparse Maximal 2-Planar Graphs

  • Christopher Auer
  • Franz J. Brandenburg
  • Andreas Gleißner
  • Kathrin Hanauer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7704)

Abstract

A simple undirected graph G = (V,E) is k-planar if it can be drawn in the plane such that each edge is crossed at most k times, incident edges do not cross, and a pair of edges must not cross twice. Such graphs have attracted many graph drawers, see [1] and the references given there.

Keywords

Algorithm Analysis Human Computer Interaction Rotation System Incident Edge Discrete Mathematic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Brandenburg, F.J., Eppstein, D., Gleißner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the Density of Maximal 1-Planar Graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 327–338. Springer, Heidelberg (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Christopher Auer
    • 1
  • Franz J. Brandenburg
    • 1
  • Andreas Gleißner
    • 1
  • Kathrin Hanauer
    • 1
  1. 1.University of PassauPassauGermany

Personalised recommendations