Optimum embedding of complete graphs in books

DOI10.1016/S0012-365X(97)00131-3zbMath0911.05055MaRDI QIDQ1379820

Tomasz Bilski

Publication date: 4 May 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bookembeddingcomplete graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

Embedding generalized Petersen graph in books ⋮ A survey on book-embedding of planar graphs ⋮ Embedding planar 5-graphs in three pages ⋮ Embedding connected double-loop networks with even cardinality in books ⋮ Embedding the incomplete hypercube in books ⋮ Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis

Cites Work

• A framework for solving VLSI graph layout problems
• The book thickness of a graph
• Single Row Routing
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Sorting Using Networks of Queues and Stacks

This page was built for publication: Optimum embedding of complete graphs in books