The linkedness of cubical polytopes: the cube

DOI10.37236/9848zbMath1471.52008arXiv2009.07072OpenAlexW3199704168MaRDI QIDQ2049620

Julien Ugon, Hoa T. Bui, Guillermo Pineda-Villavicencio

Publication date: 27 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

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)

Related Items (3)

Edge connectivity of simplicial polytopes ⋮ The linkedness of cubical polytopes: beyond the cube ⋮ Connectivity of cubical polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• The disjoint paths problem in quadratic time
• On the graph structure of convex polyhedra in \(n\)-space
• Disjoint edge paths between given vertices of a convex polytope
• Disjoint paths in graphs
• 2-linked graphs
• On linkedness in the Cartesian product of graphs
• Minimum cutsets in hypercubes
• An improved linear edge bound for graph linkages
• Graph minors. XIII: The disjoint paths problem
• Polytopality and Cartesian products of graphs
• Connectivity of cubical polytopes
• 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
• Combinatorial optimization. Theory and algorithms

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