On linkages in polytope graphs
From MaRDI portal
Publication:3087014
DOI10.1515/ADVGEOM.2011.015zbMATH Open1232.05111MaRDI QIDQ3087014FDOQ3087014
Ronald Frank Wotzlaw, Axel Werner
Publication date: 2 August 2011
Published in: advg (Search for Journal in Brave)
Recommendations
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Disjoint paths in graphs
- An improved linear edge bound for graph linkages
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Constructions for projectively unique polytopes
- Rigidity and the lower bound theorem. I
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- On the facial structure of convex polytopes
- Simplicial faces and sections of a convex polytope
- Disjoint edge paths between given vertices of a convex polytope
Cited In (12)
- Linkage on the infinite grid
- Linkage for the diamond and the path with four vertices
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- The linkedness of cubical polytopes: the cube
- The linkedness of cubical polytopes: beyond the cube
- An improved linear edge bound for graph linkages
- Linkages in Polytope Graphs
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
- Embedding linkages on an integer lattice
- Topology of equilateral polygon linkages
- Disjoint edge paths between given vertices of a convex polytope
- A property of graphs of convex polytopes
This page was built for publication: On linkages in polytope graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087014)
