1 paper · 1 filter
Steven Chaplick, Henry Förster, Michael Hoffmann +1
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n-10)/5 (of potentially 3n-6) edges cross the spine, and every edge crosses the spi…