An exponential bound for simultaneous embeddings of planar graphs
From MaRDI portal
Publication:6063275
DOI10.1007/s00373-023-02699-9zbMath1526.05101arXiv2305.15721OpenAlexW4385953094MaRDI QIDQ6063275
Pardis Semnani, Ritesh Goenka, Chi Hoi Yip
Publication date: 7 November 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.15721
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- A linear-time algorithm for drawing a planar graph on a grid
- How to draw a planar graph on a grid
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On simultaneous planar graph embeddings
- Bemerkungen zum Vierfarbenproblem
- Research Problems in Discrete Geometry
- A Note on Universal Point Sets for Planar Graphs
- Superpatterns and Universal Point Sets
- On Universal Point Sets for Planar Graphs
This page was built for publication: An exponential bound for simultaneous embeddings of planar graphs
