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

DOI10.1007/S00373-024-02775-8MaRDI QIDQ6489355zbMATH OpenFDO

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

Publication date 21 April 2024

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

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)

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

Cites work

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

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)