Book Embeddings of k-Map Graphs

12/12/2020
by   Franz J. Brandenburg, et al.
0

A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a k-map graph, at most k countries meet in a point. A graph is k-planar if it can be drawn in the plane with at most k crossings per edge. A p-page book embedding of a graph is a linear ordering of the vertices and an assignment of the edges to p pages, so that there is no conflict for edges assigned to the same page. The minimum number of pages is the book thickness of a graph, also known as stack number or page number. We show that every k-map graph has a book embedding in 6⌊ k/2 ⌋+5 pages, which, for n-vertex graphs, can be computed in O(kn) time from its map. Our result improves the best known upper bound. Towards a lower bound, it is shown that some k-map graphs need ⌊ 3k/4 ⌋ pages. In passing, we obtain an improved upper bound of eleven pages for 1-planar graphs, which are subgraphs of 4-map graphs, and of 17 pages for optimal 2-planar graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2020

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 ...
research
05/28/2020

Planar Graphs that Need Four Pages

We show that there are planar graphs that require four pages in any book...
research
07/23/2019

Local and Union Page Numbers

We introduce the novel concepts of local and union book embeddings, and,...
research
08/22/2017

Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the p...
research
03/31/2020

Artificial chemistry experiments with chemlambda, lambda calculus, interaction combinators

Given a graph rewrite system, a graph G is a quine graph if it has a non...
research
11/25/2021

Modular Irregularity Strength of Triangular Book Graph

This paper deals with the modular irregularity strength of a graph of n ...
research
03/19/2019

Upward Book Embeddings of st-Graphs

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

Please sign up or login with your details

Forgot password? Click here to reset