Planar Graphs that Need Four Pages
arXiv:2005.14111 · doi:10.1016/j.jctb.2020.05.008
Abstract
We show that there are planar graphs that require four pages in any book embedding.
To be published in Journal of Combinatorial Theory, Series B
arXiv:2005.14111 · doi:10.1016/j.jctb.2020.05.008
We show that there are planar graphs that require four pages in any book embedding.
To be published in Journal of Combinatorial Theory, Series B