On linkages in polytope graphs

DOI10.1515/ADVGEOM.2011.015zbMath1232.05111MaRDI QIDQ3087014

Ronald Frank Wotzlaw, Axel Werner

Publication date: 2 August 2011

Published in: advg (Search for Journal in Brave)

zbMATH Keywords

\(k\) disjoint pathsminimal linkedness

Mathematics Subject Classification ID

Paths and cycles (05C38) Polytopes and polyhedra (52B99)

Related Items

The linkedness of cubical polytopes: beyond the cube, The linkedness of cubical polytopes: the cube

Cites Work

• Rigidity and the lower bound theorem. I
• Disjoint edge paths between given vertices of a convex polytope
• Disjoint paths in graphs
• Constructions for projectively unique polytopes
• An improved linear edge bound for graph linkages
• Graph minors. XIII: The disjoint paths problem
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Simplicial faces and sections of a convex polytope
• On the facial structure of convex polytopes
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes