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 …

Graph theory, a branch of mathematics, studies relationships between entities using vertices
and edges. In this field, Uncertain Graph Theory has emerged to capture the uncertainties …

We investigate which planar point sets allow simultaneous straight-line embeddings of all
planar graphs on a fixed number of vertices. We first show that at least (1.293-o (1)) n points …

The planar slope number psn (G) psn (G) of a planar graph G is the minimum number of
edge slopes in a planar straight-line drawing of G. It is known that psn (G) ∈ O (c^\varDelta) …

A finite set $ P $ of points in the plane is $ n $-universal with respect to a class $\mathcal {C}
$ of planar graphs if every $ n $-vertex graph in $\mathcal {C} $ admits a crossing-free …

The planar slope number psn (G) of a planar graph G is the minimum number of edge
slopes in a planar straight-line drawing of G. It is known that psn (G)∈ O (c Δ) for every …

We consider the point set embedding problem (PSE) for 1-, 2-and k-planar graphs where at
most 1, 2, or k crossings resp. are allowed for each edge which greatly extends the well …

Universal geometric graphs∗ Page 1 Combinatorics, Probability and Computing (2023), 32, pp.
742–761 doi:10.1017/S0963548323000135 ARTICLE Universal geometric graphs∗ Fabrizio …

A drawing of a graph is a map** of each vertex to a point in the plane and of each edge to
a Jordan arc between its endvertices. A drawing is straight-line if each edge is represented …

The planar slope number psn (G) of a planar graph G is the minimum number of edge
slopes in a planar straight-line drawing of G. It is known that psn (G)∈ O (c∆) for every …