Adjacency graphs of polyhedral surfaces
From MaRDI portal
Cites work
- Algorithmic solvability of the lifting-extension problem
- Contact graphs of line segments are NP-complete
- Contact representations of planar graphs with cubes
- Embeddability in R^3 is NP-hard
- Embeddability of Simplicial Complexes is Undecidable
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Facility location on a polyhedral surface
- Hardness of embedding simplicial complexes in R^d
- Homothetic triangle representations of planar graphs
- scientific article; zbMATH DE number 739017 (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?)
- Invariants of graph drawings in the plane
- Kontaktprobleme der konformen Abbildung.
- Linear-time algorithms for hole-free rectilinear proportional contact graph representations
- On a problem of K. Zarankiewicz
- On touching triangle graphs
- On Triangle Contact Graphs
- Optimal polygonal representation of planar graphs
- Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus
- Realization spaces of polytopes
- 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)
- Steinitz theorems for simple orthogonal polyhedra
- Touching triangle representations for 3-connected planar graphs
- Unit contact representations of grid subgraphs with regular polytopes in 2D and 3D
- Ü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 Q7234067)
