Graphs with E Edges Have Pagenumber O(√E)

1994/07/01 by Seth M. Malitz, S.M. Malitz · 5 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Combinatorics #Computer science #Discrete mathematics #Embedding #Graph #Interconnection Networks and Systems #Mathematics #Multiple edges #Upper and lower bounds #Vertex (graph theory) #graph theory and CDMA systems

paper · doi:10.1006/jagm.1994.1027

crossref issued 1994/07/01 · crossref published 1994/07/01 · crossref published-print 1994/07/01 · openalex publication_date 1994/07/01 · crossref created 2002/10/06 · crossref deposited 2019/05/07 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06 · crossref indexed 2026/05/09

Cited by

• Stack-Number is Not Bounded by Queue-Number
• RNA Structures with Pseudo-knots: Graph-theoretical, Combinatorial, and Statistical Properties
• Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
• Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
• Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages
• Book embedding [wikipedia]