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 …

The page number of a directed acyclic graph is the minimum for which there is a topological
ordering of and a-coloring of the edges such that no two edges of the same color cross, ie …

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 …

Among the vast literature concerning graph drawing and graph theory, linear layouts of
graphs have been the subject of intense research over the years, both from a combinatorial …

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 this paper we study the computational complexity of the Upward Planarity Extension
problem, which takes as input an upward planar drawing Γ H of a subgraph H of a directed …

In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge $ e $ is
represented as a polyline composed of a vertical segment with its lowest endpoint at the tail …

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book
thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that …

A k-page upward book embedding (k UBE) of a directed acyclic graph G is a book
embeddings of G on k pages with the additional requirement that the vertices appear in a …