2 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
T-Shape Visibility Representations of 1-Planar Graphs
Franz J. Brandenburg
A shape visibility representation displays a graph so that each vertex is represented by an orthogonal polygon of a particular shape and for each edge there is a horizontal or vert…
On the Relationship between -Planar and -Quasi Planar Graphs
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +6
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. A graph is -quasi planar if it can be drawn in…