---
tag: 6CH2AX56BC
kind: concept
name: Book embedding
aliases: [blankenship-oporowski-conjecture, book-thickness]
sources:
  - wikipedia: en:3987703@r1375441445
    locator: Book embedding
    note: adopted
    mention: wikipedia://en/3987703
    sections: [Summary]
same_as:
  wikidata: Q4942980
  wikipedia: Book embedding
inventory: [P4JVSF8H1A]
---

## Summary

In graph theory, a **book embedding** is a generalization of [[planar embedding|029JQEK15B]] of a [[graph|00C0BR7D7H]] to embeddings in a *book*, a collection of half-planes all having the same [[line|0MP9BCF6DP]] as their boundary. Usually, the vertices of the graph are required to lie on this boundary line, called the *spine*, and the edges are required to stay within a single half-plane. The **book thickness** of a graph is the smallest possible number of half-planes for any book embedding of the graph. Book thickness is also called **pagenumber**, **stacknumber** or **fixed outerthickness**. Book embeddings have also been used to define several other graph invariants including the pagewidth and book crossing number.