NIC-planar graphs

A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident to at most one crossing edge, and specializes 1-pla...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2017-12, Vol.232, p.23-40
Hauptverfasser:	Bachmaier, Christian, Brandenburg, Franz J., Hanauer, Kathrin, Neuwirth, Daniel, Reislhuber, Josef
Format:	Artikel
Sprache:	eng
Schlagworte:	1-planarity Density Graph theory Graphs Mathematics NIC-planarity Recognition Right-angle crossings (RAC)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!