Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
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… 
2016
2016
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter… 
Highly Cited
2014
Highly Cited
2014
A graph is 1-planar if it can be embedded in the plane with at most one crossing per edge. It is known that the problem of… 
2005
2005
In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP… 
Highly Cited
2005
Highly Cited
2005
  • V. DujmovicD. Wood
  • International Symposium Graph Drawing and Network…
  • 2005
  • Corpus ID: 9141367
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours… 
2003
2003
In molecular biology, RNA structure comparison is of great i nterest to help solving problems as different as phylogeny… 
Highly Cited
2001
Highly Cited
2001
Highly Cited
1998
Highly Cited
1998
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane… 
Highly Cited
1989
Highly Cited
1989
  • M. Yannakakis
  • Journal of computer and system sciences (Print)
  • 1989
  • Corpus ID: 5236549
Highly Cited
1979
Highly Cited
1979