The linkedness of cubical polytopes: beyond the cube

DOI10.1016/J.DISC.2023.113801zbMath1530.52006arXiv2009.07071OpenAlexW3084573328MaRDI QIDQ6177409

No author found.

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.07071

zbMATH Keywords

connectivitycubeseparatorlinkedness\(k\)-linkedcubical polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Disjoint edge paths between given vertices of a convex polytope
• An improved linear edge bound for graph linkages
• Graph minors. XIII: The disjoint paths problem
• Polytopality and Cartesian products of graphs
• The linkedness of cubical polytopes: the cube
• Highly linked graphs
• Graph Theory
• On linkages in polytope graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Lectures on Polytopes
• Incidence graphs of convex polytopes
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

This page was built for publication: The linkedness of cubical polytopes: beyond the cube