arXiv:2005.14111 [math.CO]AbstractReferencesReviewsResources Planar Graphs that Need Four Pages Mihalis Yannakakis Published 2020-05-28Version 1 We show that there are planar graphs that require four pages in any book embedding. Comments: To be published in Journal of Combinatorial Theory, Series B Categories: math.CO, cs.DM, cs.DS Keywords: planar graphs Related articles: Most relevant | Search more arXiv:2009.07932 [math.CO] (Published 2020-09-16) On Weak Flexibility in Planar Graphs Bernard Lidický, Tomáš Masařík, Kyle Murphy, Shira Zerbib arXiv:1709.05904 [math.CO] (Published 2017-09-18) Localization game on geometric and planar graphs Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak arXiv:1402.1813 [math.CO] (Published 2014-02-08, updated 2014-08-05) Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs Luke Postle, Robin Thomas Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:2005.14111 [math.CO]](http://oss.arxitics.com/images/favicon.svg)