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

As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

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 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 …

In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex.
Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt [35], who …

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 …

We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with
at most three colors, such that no two edges of the same color cross. This implies that 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 …