Adjacency graphs of polyhedral surfaces
type: Item
instance of: scholarly article
title: Adjacency graphs of polyhedral surfaces
zbMATH Open document ID: 1539.05103
author: Elena Arseneva
author: Linda Kleist
author: Boris Klemz
author: Maarten Löffler
author: André Schulz
author: Birgit Vogtenhuber
author: Alexander Wolff
published in: Discrete \& Computational Geometry
publication date: 2024-05-21T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7851509
zbMATH Keywords: polyhedral complexes
zbMATH Keywords: realizability
zbMATH Keywords: contact representation
MaRDI profile type: Publication
cites work: Computing cartograms with optimal complexity
cites work: Q5589820
cites work: Facility location on a polyhedral surface
cites work: Strictly convex drawings of planar graphs
cites work: Q5589866
cites work: Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
cites work: Unit disk graph recognition is NP-hard
cites work: Algorithmic solvability of the lifting-extension problem
cites work: Q4945507
cites work: Q4328183
cites work: Q4347887
cites work: Optimal polygonal representation of planar graphs
cites work: Steinitz Theorems for Orthogonal Polyhedra
cites work: Representing graphs and hypergraphs by touching polygons in 3D
cites work: Rectangle and Square Representations of Planar Graphs
cites work: Contact representations of planar graphs with cubes
cites work: Embeddability of Simplicial Complexes is Undecidable
cites work: On Touching Triangle Graphs
cites work: Homothetic triangle representations of planar graphs
cites work: On Floor-Plan of Plane Graphs
cites work: Classes and recognition of curve contact graphs
cites work: Contact graphs of line segments are NP-complete
cites work: Representing graphs by disks and balls (a survey of recognition-complexity results)
cites work: Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
cites work: On a problem of K. Zarankiewicz
cites work: Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
cites work: Q6104075
cites work: Touching Triangle Representations for 3-Connected Planar Graphs
cites work: Q5767542
cites work: Embeddability in the 3-Sphere Is Decidable
cites work: Hardness of embedding simplicial complexes in \(\mathbb R^d\)
cites work: Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus
cites work: Embeddability in $\mathbb{R}^3$ is NP-hard
cites work: A note on geometric embeddings of simplicial complexes in a Euclidean space
cites work: Q3757930
cites work: Square tilings with prescribed combinatorics
cites work: Invariants of graph drawings in the plane
cites work: Extendability of simplicial maps is undecidable
cites work: Color-critical graphs on a fixed surface
cites work: Über das Problem der Nachbargebiete im Raum.
cites work: Necessary Conditions for Geometric Realizability of Simplicial Complexes
cites work: Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
cites work: Q3499995
DOI: 10.1007/S00454-023-00537-6
description: scientific article; zbMATH DE number 7851509