In this paper we study the page number of upward planar directed acyclic graphs. We prove that: (1) the page number of any n-vertex upward planar triangulation G whose every maximal 4-connected component has page number k is at most min{O(k logn), O(2)}; (2) every upward planar triangulation G with o( n logn ) diameter has o(n) page number; and (3) every upward planar triangulation has a vertex...
