Disjoint edge paths between given vertices of a convex polytope

DOI10.1016/0097-3165(85)90086-XzbMATH Open0572.05038OpenAlexW1976069827MaRDI QIDQ1062071FDOQ1062071

S. 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

Recommendations

• On linkages in polytope graphs
• Linkages in Polytope Graphs
• scientific article; zbMATH DE number 3962623
• Disjoint paths in graphs. (Reprint)
• Maximum graphs not spannable by \(r\) disjoint paths

zbMATH Keywords

convex polytopesdisjoint edge paths

Mathematics Subject Classification ID

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

Cites Work

• Extensions of Menger's Theorem^†
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Title not available (Why is that?)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062071)