  It is shown that the number of pages required for a book embedding of a graph
is the maximum of the numbers needed for any of the maximal nonseparable
subgraphs and that a plane graph in which every triangle bounds a face has a
two-page book embedding. The latter extends a theorem of H. Whitney and gives
two-page book embeddings for $X$-trees and square grids.
