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 recently introduced twin-width of a graph G is the minimum integer d such that G has a d-
contraction sequence, that is, a sequence of| V (G)|–1 iterated vertex identifications for which …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

We show that planar graphs have bounded queue-number, thus proving a conjecture of
Heath et al.[66] from 1992. The key to the proof is a new structural tool called layered …

Stack-number is not bounded by queue-number Page 1 COMBINATORICA Bolyai Society –
Springer-Verlag 0209–9683/122/$6.00 c 2022 János Bolyai Mathematical Society and …

In a total order of the vertices of a graph, two edges with no endpoint in common can
be\emphcrossing,\emphnested, or\emphdisjoint. A\emphk-stack (respectively,\emphk …

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 …

Classes with bounded expansion, which generalise classes that exclude a topological
minor, have recently been introduced by Nešetřil and Ossona de Mendez. These classes …

Graph separators are a ubiquitous tool in graph theory and computer science. However, in
some applications, their usefulness is limited by the fact that the separator can be as large …

A queue layout of a graph G consists of a linear order of the vertices of G and a partition of
the edges of G into queues, so that no two independent edges of the same queue are …