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

The planar graph product structure theorem of Dujmović et al.[J. ACM, 67 (2020), 22] states
that every planar graph is a subgraph of the strong product of a graph with bounded …

We give new results about the relationship between 1-planar graphs and RAC graphs. A
graph is 1-planar if it has a drawing where each edge is crossed at most once. A graph is …

We introduce the family of k-gap-planar graphs for k≥ 0, ie, graphs that have a drawing in
which each crossing is assigned to one of the two involved edges and each edge is …

A graph is $ k $-planar if it can be drawn in the plane such that no edge is crossed more
than $ k $ times. While for $ k= 1$, optimal $1 $-planar graphs, ie, those with $ n $ vertices …

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 …

We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and
strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in the …

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is
crossed at most once, and is optimal if it has the maximum of 4 n-8 4 n-8 edges. We show …

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 …