Optimum embedding of complete graphs in books

DOI10.1016/S0012-365X(97)00131-3MaRDI QIDQ1379820zbMATH OpenFDO

Authors 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) Applications of graph theory to circuits and networks (94C15) Graph theory (05C99)

Recommendations

• A trade-off between page number and page width of book embeddings of graphs
• scientific article; zbMATH DE number 4185630
• Embedding planar graphs in four pages
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine

Cites work

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

Cited in

(17)

• Embedding the incomplete hypercube in books
• A survey on book-embedding of planar graphs
• Embedding planar 5-graphs in three pages
• scientific article; zbMATH DE number 4185630 (Why is no real title available?)
• Improved book-embeddings of incomplete hypercubes
• Simpler algorithms for testing two-page book embedding of partitioned graphs
• Embedding Outerplanar Graphs in Small Books
• scientific article; zbMATH DE number 6902663 (Why is no real title available?)
• scientific article; zbMATH DE number 3914339 (Why is no real title available?)
• On the page number of complete odd-partite graphs
• A trade-off between page number and page width of book embeddings of graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
• Book embeddability of series-parallel digraphs
• Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
• Embedding generalized Petersen graph in books
• Embedding connected double-loop networks with even cardinality in books

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379820)