Adjacency graphs of polyhedral surfaces

DOI10.1007/S00454-023-00537-6MaRDI QIDQ6541985zbMATH OpenFDO

Authors Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff

Publication date 21 May 2024

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

realizabilitycontact representationpolyhedral complexes

Mathematics Subject Classification ID

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)

Recommendations

• Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs))
• Graphs of polyhedra; polyhedra as graphs
• scientific article; zbMATH DE number 4110708
• A convexity problem in 3-polytopal graphs
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra

Cites work

• scientific article; zbMATH DE number 4006289 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• scientific article; zbMATH DE number 1047720 (Why is no real title available?)
• scientific article; zbMATH DE number 1424295 (Why is no real title available?)
• scientific article; zbMATH DE number 3308932 (Why is no real title available?)
• scientific article; zbMATH DE number 3308985 (Why is no real title available?)
• scientific article; zbMATH DE number 3027510 (Why is no real title available?)
• scientific article; zbMATH DE number 7692362 (Why is no real title available?)
• A note on geometric embeddings of simplicial complexes in a Euclidean space
• Algorithmic solvability of the lifting-extension problem
• Classes and recognition of curve contact graphs
• Color-critical graphs on a fixed surface
• Computing cartograms with optimal complexity
• Contact graphs of line segments are NP-complete
• Contact representations of planar graphs with cubes
• Embeddability in \(\mathbb R^3\) is NP-hard
• Embeddability of Simplicial Complexes is Undecidable
• Extendability of simplicial maps is undecidable
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Facility location on a polyhedral surface
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Hardness of embedding simplicial complexes in R^d
• Homothetic triangle representations of planar graphs
• Invariants of graph drawings in the plane
• Necessary Conditions for Geometric Realizability of Simplicial Complexes
• On Floor-Plan of Plane Graphs
• On a problem of K. Zarankiewicz
• On touching triangle graphs
• Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus
• Polyhedral surfaces of high genus
• Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
• Rectangle and Square Representations of Planar Graphs
• Representing graphs and hypergraphs by touching polygons in 3D
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• Square tilings with prescribed combinatorics
• Strictly convex drawings of planar graphs
• Touching triangle representations for 3-connected planar graphs
• Unit contact representations of grid subgraphs with regular polytopes in 2D and 3D
• Unit disk graph recognition is NP-hard
• Über das Problem der Nachbargebiete im Raum.

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)