… depend on the number of … crossings per edge in both 1 -page and 2 -page drawings. We
then prove that if the vertex degree is bounded by Δ , every planar 3-tree has a 2 -page drawing …

… of edges in a k-page graph drawing can cross each other. … We define a 2-page crossing
diagram to be a 1-page crossing … a 2-page crossing diagram we define the crossing number to …

… on the number of the … k crossings per edge in either a 1-page or a 2-page drawing. We
then prove that if the vertex degree is bounded by \(\varDelta \), every planar 3-tree has a 2-page …

… require more than k crossings per edge in either a 1-page or a 2-page drawing. We then …
bounded by Δ , every planar 3-tree has a 2-page drawing with a number of crossings per edge …

… -page crossing number of a graph G provides an upper bound for … we define each edge in
adjacency matrix with the number of … heuristic algorithms based on the latest 1-page drawing …

… the exact 1-page and 2-page crossing numbers of several … a 2-page drawing D of Kn with
ν2(Kn) edge crossings. Let G … lower bounding the number of crossings in any 2-page drawing …

… Since 2-page book embedding is NP-complete [10], there … kinds of 1-page graphs, by which
two upper bound functions of … book drawing with a bounded number of crossings per edge […

… by both the bounded number b of crossings per edge and the vertex cover number \(\tau \) …
parameterized by both the bounded number b of crossings per edge and the pathwidth \(\…

… Among other things, we closely bound the local crossing number for vertex-alternating … In
a 2-page book drawing using this model, we color the edges with red and blue. For vertices u …

… 1-page drawings are circular drawings, in which the vertices are placed on a circle and all
edges … have been the first to construct 2-page drawings of Kn with Z2(n) crossings. In the same …