Unraveling k-page graphs

Abstract

I show in this note that for any integer k and any k page graph G, there is an easily constructed 3-page graph G′ (called the unraveling of G) such that the minimum separator sizes of G and G′ are within a factor of k of each other. Further the maximum degree of a vertex of G′ is at most 2 plus the maximum degree of G.