Log In Sign Up

Four Pages Are Indeed Necessary for Planar Graphs

by   Michael A. Bekos, et al.

An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum number of pages over all its book embeddings. Accordingly, the book thickness of a class of graphs is the maximum book thickness over all its members. In this paper, we address a long-standing open problem regarding the exact book thickness of the class of planar graphs, which previously was known to be either three or four. We settle this problem by demonstrating planar graphs that require four pages in any of their book embeddings, thus establishing that the book thickness of the class of planar graphs is four.


page 1

page 2

page 3

page 4


Planar Graphs that Need Four Pages

We show that there are planar graphs that require four pages in any book...

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a ...

On Dispersable Book Embeddings

In a dispersable book embedding, the vertices of a given graph G must be...

Upward Book Embeddings of st-Graphs

We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...

Monotone Arc Diagrams with few Biarcs

We show that every planar graph can be represented by a monotone topolog...

Modular Irregularity Strength of Triangular Book Graph

This paper deals with the modular irregularity strength of a graph of n ...

Book Embeddings of k-Map Graphs

A map is a partition of the sphere into regions that are labeled as coun...