Disjoint edge paths between given vertices of a convex polytope

DOI10.1016/0097-3165(85)90086-XzbMath0572.05038OpenAlexW1976069827MaRDI QIDQ1062071

Steve Gallivan

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90086-x

zbMATH Keywords

convex polytopesdisjoint edge paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Polytopes and polyhedra (52Bxx)

Related Items (6)

Linkages in Polytope Graphs ⋮ Linkedness of Cartesian products of complete graphs ⋮ The linkedness of cubical polytopes: beyond the cube ⋮ The linkedness of cubical polytopes: the cube ⋮ On linkages in polytope graphs ⋮ Variational analysis down under open problem session

Cites Work

• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Extensions of Menger's Theorem^†
• Unnamed Item

This page was built for publication: Disjoint edge paths between given vertices of a convex polytope