A survey on graph drawing beyond planarity
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and
studies geometric representations of nonplanar graphs in terms of forbidden crossing …
studies geometric representations of nonplanar graphs in terms of forbidden crossing …
An annotated bibliography on 1-planarity
The notion of 1-planarity is among the most natural and most studied generalizations of
graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at …
graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at …
[HTML][HTML] Book embeddings of k-framed graphs and k-map graphs
An embedding of a graph in a book, called book embedding, consists of a linear ordering of
its vertices along the spine of the book and an assignment of its edges to the pages of the …
its vertices along the spine of the book and an assignment of its edges to the pages of the …
Book embeddings of nonplanar graphs with small faces in few pages
An embedding of a graph in a book, called book embedding, consists of a linear ordering of
its vertices along the spine of the book and an assignment of its edges to the pages of the …
its vertices along the spine of the book and an assignment of its edges to the pages of the …
Three-dimensional graph products with unbounded stack-number
We prove that the stack-number of the strong product of three n-vertex paths is Θ (n 1/3). The
best previously known upper bound was O (n). No non-trivial lower bound was known. This …
best previously known upper bound was O (n). No non-trivial lower bound was known. This …
Stack and queue layouts via layered separators
It is known that every proper minor-closed class of graphs has bounded stack-number (aka
book thickness and page number). While this includes notable graph families such as planar …
book thickness and page number). While this includes notable graph families such as planar …
Experimental evaluation of book drawing algorithms
A k-page book drawing of a graph G=(V, E) consists of a linear ordering of its vertices along
a spine and an assignment of each edge to one of the k pages, which are half-planes …
a spine and an assignment of each edge to one of the k pages, which are half-planes …
Fan-crossing free graphs and their relationship to other beyond-planar graphs
FJ Brandenburg - Theoretical Computer Science, 2021 - Elsevier
A graph is fan-crossing free if it has a drawing in the plane so that each edge is crossed by
independent edges, that is the crossing edges have distinct vertices. On the other hand, it is …
independent edges, that is the crossing edges have distinct vertices. On the other hand, it is …
A survey on book-embedding of planar graphs
X Guan, C Wu, W Yang, J Meng - Frontiers of Mathematics in China, 2022 - Springer
The book-embedding problem arises in several area, such as very large scale integration
(VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into …
(VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into …
1-planarity testing and embedding: An experimental study
Many papers study the natural problem of drawing nonplanar graphs with few crossings per
edge. In particular, a graph is 1-planar if it can be drawn in the plane with at most one …
edge. In particular, a graph is 1-planar if it can be drawn in the plane with at most one …