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 …

An embedding of a graph in a book consists of a linear order of its vertices along the spine of
the book and of an assignment of its edges to the pages of the book, so that no two edges on …

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 …

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 …

We study $ k $-page upward book embeddings ($ k $ UBEs) of $ st $-graphs, that is, book
embeddings of single-source single-sink directed acyclic graphs on $ k $ pages with the …

In a book embedding, the vertices of a graph are placed on the “spine” of a book and the
edges are assigned to “pages”, so that edges on the same page do not cross. In this paper …

A $ k $-page book embedding of a graph $ G $ draws the vertices of $ G $ on a line and the
edges on $ k $ half-planes (called pages) bounded by this line, such that no two edges on …

The page-number of a directed acyclic graph (a DAG, for short) is the minimum k for which
the DAG has a topological order and a k-coloring of its edges such that no two edges of the …

In a dispersable book embedding, the vertices of a given graph G must be ordered along a
line ℓ, called spine, and the edges of G must be drawn in different half-planes bounded by ℓ …

We show that every triconnected planar graph of maximum degree five is subhamiltonian
planar. A graph is subhamiltonian planar if it is a subgraph of a Hamiltonian planar graph or …