The Density of Classes of 1-Planar Graphs

Auer, Christopher and Bachmaier, Christian and Brandenburg, Franz J. and Gleißner, Andreas and Hanauer, Kathrin and Neuwirth, Daniel (2013) The Density of Classes of 1-Planar Graphs. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 524-525 .

Full text not available from this repository.

Item Type:Conference Poster
Classifications:G Algorithms and Complexity > G.420 Crossings
ID Code:1407

Repository Staff Only: item control page


Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line drawings of 3-connected 1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 83-94. Springer, Heidelberg (2013)

Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Recognizing outer 1-planar graphs in linear time. In: Wismath, S. Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 107-118. Springer, Heidelberg (2013)

Bodendiek, R., Schumacher, H., Wagner, K.: Über 1-optionale Graphen. Mathematische Nachrichten 117, 323-339 (1984)

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)

Didimo, W.: Density of straight-line 1-planar graph drawings. Inform. Process. Lett. 113(7). 236-240 (2013)

Hudák, D., Madaras, T., Suzuki, Y.: On properties of maximal 1-planar graphs. Discuss. Math. Graph Theory 32(4), 737-747 (2012)

Karpov, D.V.: Upper bound on the number of edges of an almost planar bipartite graph. Tech. Rep. arXiv:1307.1013v1 (math.CO), Computing Research Repository (CoRR) (July 2013)

Xu, C.: Algorithmen für die Dichte von Graphen. Master's thesis, University of Passau (2013)