Using Euler’s Formula to Find the Lower Bound of the Page Number

DOI10.1007/S00373-024-02775-8MaRDI QIDQ6489355FDOQ6489355

Authors: Bin Zhao, Peng Li, Jixiang Meng, Yuepeng Zhang 

Publication date: 21 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• A survey on book-embedding of planar graphs
• Graphs with E Edges Have Pagenumber O(√E)
• Four pages are indeed necessary for planar graphs
• A survey on book-embedding of planar graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Title not available (Why is that?)
• Random Graphs
• Decomposition of Finite Graphs Into Forests
• The book thickness of a graph
• Embedding connected double-loop networks with even cardinality in books
• Embedding planar graphs in four pages
• The pagenumber of toroidal graphs is at most seven
• On the pagenumber of complete bipartite graphs
• Sorting Using Networks of Queues and Stacks
• Title not available (Why is that?)
• Introduction to Random Graphs
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Single Row Routing
• Embedding planar 5-graphs in three pages
• Embedding Cartesian product of some graphs in books

This page was built for publication: Using Euler’s Formula to Find the Lower Bound of the Page Number

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