Constructing Outerplanar and 2-Page Book Embeddings for Degree Sequences

Every degree sequence in the family D with even sum between 2n and 4n-6-2ω1 can be realized by either a provably non-outerplanar graph or a graph with a 2-page book embedding, one of whose pages is also bipartite.