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…

2018

A \emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the…

2016

A graph $G$ has a $k$-page book embedding if $G$ can be embedded into a $k$-page book. The minimum $k$ such that $G$ has a $k…

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…

2013

We introduce a special type of graph embedding called book embedding and apply it to posets. A book embedding scheme for…

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…

2008

Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours…

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…

2008

Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to…

1987

THE `DIOGENES'' METHODOLOGY PRODUCES DESIGNS FOR FAULT-TOLERANT VLSI PROCESSOR ARRAYS IN THREE STAGES. IN THE FIRST STAGE, THE…