Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and
studies geometric representations of nonplanar graphs in terms of forbidden crossing …

A topological drawing of a graph is fan-planar if for each edge $ e $ the edges crossing $ e $
form a star and no endpoint of $ e $ is enclosed by $ e $ and its crossing edges. A fan …

The study of nonplanar graph drawings with forbidden or desired crossing configurations
has a long tradition in geometric graph theory, and received an increasing attention in the …

A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k pairwise crossing
edges, and k-planar if no edge is crossed more than k times. In this paper, we explore the …

Edge bundling is an important concept, heavily used for graph visualization purposes. To
enable the comparison with other established nearly-planarity models in graph drawing, we …

A drawing of a graph is fan-planar if the edges intersecting a common edge a share a vertex
A on the same side of a. More precisely, orienting e arbitrarily and the other edges towards A …

A fan-planar graph is a graph that admits a drawing, in which each edge can cross only
edges with a common endvertex, and this endvertex is on the same side of the edge. Hence …

A drawing of a graph is fan-planar if the edges intersecting a common edge $ a $ share a
vertex $ A $ on the same side of $ a $. More precisely, orienting $ a $ arbitrarily and the …

Graph drawing beyond planarity is a research area that has received an increasing attention
in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in …

A graph is k-planar (k ≥ 1)(k≥ 1) if it can be drawn in the plane such that no edge is
crossed k+ 1 k+ 1 times or more. A graph is k-quasi-planar (k ≥ 2)(k≥ 2) if it can be drawn …