Planar Graphs that Need Four Pages
Combinatorics
2020-06-05 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
We show that there are planar graphs that require four pages in any book embedding.
Cite
@article{arxiv.2005.14111,
title = {Planar Graphs that Need Four Pages},
author = {Mihalis Yannakakis},
journal= {arXiv preprint arXiv:2005.14111},
year = {2020}
}
Comments
To be published in Journal of Combinatorial Theory, Series B