A logarithmic bound for simultaneous embeddings of planar graphs

DOI10.1007/S00454-024-00665-7MaRDI QIDQ6878379zbMATH OpenFDO

Authors Raphael Steiner

Publication date 6 January 2026

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-024-00665-7

zbMATH Keywords

conflict collectionplanar graphssimultaneous embeddingstraight-line drawinguniversal point set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Note on Universal Point Sets for Planar Graphs
• An exponential bound for simultaneous embeddings of planar graphs
• Congruent Graphs and the Connectivity of Graphs
• Convex hulls of random order types
• Enumerating order types for small point sets with applications
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Lower Bounds for Approximation by Nonlinear Manifolds
• On simultaneous planar graph embeddings
• On universal point sets for planar graphs
• Superpatterns and universal point sets
• The number of polytopes, configurations and real matroids

This page was built for publication: A logarithmic bound for simultaneous embeddings of planar graphs

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