Adjacency graphs of polyhedral surfaces
DOI10.1007/S00454-023-00537-6zbMATH Open1539.05103MaRDI QIDQ6541985FDOQ6541985
André Schulz, Elena Arseneva, Boris Klemz, Maarten Löffler, Linda Kleist, Alexander Wolff, Birgit Vogtenhuber
Publication date: 21 May 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Density (toughness, etc.) (05C42) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unit disk graph recognition is NP-hard
- Square tilings with prescribed combinatorics
- Color-critical graphs on a fixed surface
- On a problem of K. Zarankiewicz
- On Floor-Plan of Plane Graphs
- Title not available (Why is that?)
- Rectangle and Square Representations of Planar Graphs
- Title not available (Why is that?)
- Optimal polygonal representation of planar graphs
- On Touching Triangle Graphs
- Touching Triangle Representations for 3-Connected Planar Graphs
- Contact representations of planar graphs with cubes
- Computing cartograms with optimal complexity
- Title not available (Why is that?)
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- Title not available (Why is that?)
- A note on geometric embeddings of simplicial complexes in a Euclidean space
- Necessary Conditions for Geometric Realizability of Simplicial Complexes
- Facility location on a polyhedral surface
- Homothetic triangle representations of planar graphs
- Strictly convex drawings of planar graphs
- Steinitz Theorems for Orthogonal Polyhedra
- Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus
- Algorithmic solvability of the lifting-extension problem
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embeddability in $\mathbb{R}^3$ is NP-hard
- Embeddability of Simplicial Complexes is Undecidable
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Title not available (Why is that?)
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- Classes and recognition of curve contact graphs
- Embeddability in the 3-Sphere Is Decidable
- Invariants of graph drawings in the plane
- Über das Problem der Nachbargebiete im Raum.
- Contact graphs of line segments are NP-complete
- Title not available (Why is that?)
- Representing graphs and hypergraphs by touching polygons in 3D
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
- Extendability of simplicial maps is undecidable
- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
- Title not available (Why is that?)
This page was built for publication: Adjacency graphs of polyhedral surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541985)
