On Sparse Maximal 2-Planar Graphs
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  and the references given there.
KeywordsAlgorithm Analysis Human Computer Interaction Rotation System Incident Edge Discrete Mathematic
- 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