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…

2019

This study discusses the types and forms of command sentences in the kangdap Banjar base kambang Banjar 'Satipis Apam Barabai…

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…

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

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

2011

Let G be a directed acyclic graph (DAG). An upward (k,h)-topological book embedding of G is an upward book embedding on k pages…

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

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

1990

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