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)

Related topics

Related topics

49 relations
1-planar graph2-satisfiabilityApollonian networkArc diagram

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Embedding planar 5-graphs in three pages
2016
2016
Computing NodeTrix Representations of Clustered Graphs
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter… 
Highly Cited
2013
Highly Cited
2013
A Linear-Time Algorithm for Testing Outer-1-Planarity
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… 
2012
2012
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
2010
2010
Effects of moving acclimation cages before release of cultured fish: alternate release strategies for a juvenile winter flounder Pseudopleuronectes americanus stock enhancement effort
Biomass of winter £ounder Pseudopleuronectes americanus, a target species of both recreational and commercial ¢sheries, is at an… 
2006
2006
Book Embeddability of Series–Parallel Digraphs
In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP… 
2006
2006
On Embedding a Graph on Two Sets of Points
Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let G be a… 
2003
2003
Book embeddings of graphs
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv 
2001
2001
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
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… 
1984
1984
Book-thickness and book-coarseness of graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)