Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph

Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota

Research output: Contribution to journalArticle

23 Citations (Scopus)


In a topological book embedding of a graph, the graph is drawn in a topological book by placing the vertices along the spine of the book and drawing the edges in the pages; edges are allowed to cross the spine. Earlier results show that every graph having n vertices and m edges can be embedded into a 3-page book with at most O(m log n) edge-crossings over the spine. This paper presents lower bounds on the number of edge-crossings over the spine for a variety of graphs. These bounds show that the upper bound O(m log n) is essentially best possible.

Original languageEnglish
Pages (from-to)149-155
Number of pages7
JournalDiscrete Applied Mathematics
Issue number2-3
Publication statusPublished - 1999 Jun



  • Book embedding
  • Edge crossing
  • Topological book embedding

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this