Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2005
2005
In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2003
2003
In molecular biology, RNA structure comparison is of great i nterest to help solving problems as different as phylogeny… Expand
  • table 1
  • figure 3
  • figure 5
2001
2001
  • D. Wood
  • Graph Drawing
  • 2001
  • Corpus ID: 12322077
A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine), and an assignment… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1998
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… Expand
  • figure 1
  • figure 2
  • table 1
Highly Cited
1989
Highly Cited
1989
A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1979
Highly Cited
1979
Abstract The book thickness bt(G) of a graph G is defined, its basic properties are delineated, and relations are given with… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • figure 8