TL;DR
This paper demonstrates that certain planar graphs cannot be embedded in fewer than four pages, establishing a lower bound for book embeddings of planar graphs.
Contribution
It proves the existence of planar graphs that inherently require four pages in any book embedding, highlighting a fundamental limitation.
Findings
Existence of planar graphs needing four pages
Lower bound established for planar graph embeddings
Implication for graph embedding theory
Abstract
We show that there are planar graphs that require four pages in any book embedding.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.