2 citations · 2 across the 3 of their papers we have counts for
7 papers
On Optimal Beyond-Planar Graphs
Franz J. Brandenburg
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if…
Straight-line Drawings of 1-Planar Graphs
Franz J. Brandenburg
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawin…
Fan-Crossing Free Graphs and Their Relationship to other Beyond-Planar Graphs
Franz J. Brandenburg
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the ot…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
On Fan-Crossing Graphs
Franz J. Brandenburg
A fan is a set of edges with a single common endpoint. A graph is fan-crossing if it admits a drawing in the plane so that each edge is crossed by edges of a fan. It is fan-planar…
A Note on IC-Planar Graphs
Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer
A graph is IC-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 no common end vertex. IC-planarity speci…