The Number of Edges in Maximal 2-planar Graphs

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains $2$-planar. A $2$-planar graph on $n$ vertices has at most $5n-...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hoffmann, Michael, Reddy, Meghana M
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Geometry Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!