Book embedding

Known as: Blankenship-Oporowski conjecture, Blankenship–Oporowski conjecture, Book thickness

In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings into a book, a collection of half-planes all…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

A graph is fan-crossing free if it admits a drawing in the plane so that each edge can be crossed by independent edges. Then the…

2015

In the book embedding of an ordered set, the elements of the set are embedded along the spine of a book to form a linear…

2014

Smooth orthogonal drawings were recently introduced with the view of combining two different graph drawing approaches: Orthogonal…

2013

A 2-page book embedding of a graph is to place the vertices linearly on a spine (a line segment) and the edges on the two pages…

2012

Endo proved that every toroidal graph has a book embedding with at most seven pages. In this paper, we prove that every toroidal…

2012

A book-embedding of a graph is a linear ordering of its vertices, and a partition of its edges into non-crossing sets (called…

2010

Biomass of winter £ounder Pseudopleuronectes americanus, a target species of both recreational and commercial ¢sheries, is at an…

2008

PURPOSE: A mobile terminal and a method of displaying an object using the same are provided to display a page list like a book…

2001

We show that geometric thickness and book thickness are not asymptotically equivalent: for every t, there exists a graph with…

1990

The authors address a generalization of the book embedding problem, called the black/white (b/w) book embedding problem, where a…