Four pages are necessary and sufficient for planar graphs

1986/01/01 by Mihalis Yannakakis, M Yannakakis · 5 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computational Geometry and Mesh Generation #Computer graphics (images) #Computer science #Graph #Mathematics #Planar #Planar graph #Theoretical computer science #graph theory and CDMA systems

paper · doi:10.1145/12130.12141

crossref issued 1986/01/01 · crossref published 1986/01/01 · crossref published-print 1986/01/01 · openalex publication_date 1986/01/01 · crossref created 2003/11/25 · crossref deposited 2025/06/18 · openalex created_date 2025/10/10 · crossref indexed 2026/06/15 · openalex updated_date 2026/07/29

Citations

• Embedding Planar Graphs In Seven Pages
• The book thickness of a graph
• The Complexity of Coloring Circular Arcs and Chords

Cited by

• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• A trade-off between page number and page width of book embeddings of graphs
• On the Pagenumber of the Cube-Connected Cycles
• Book embeddings and crossing numbers
• Book embedding [wikipedia]