Connectivity of cubical polytopes, Journal of Combinatorial Theory

In this research, I focus on the graphs of convex polytopes - fundamental geometric objects in combinatorics optimisation. The structures of their graphs play a key role in the simplex method, which is the most fundamental search technique on polytopes for solving linear programming. Therefore, studying their combinatorial properties is fundamental. In this research, we deal with the connectivity of the graphs of cubical polytopes. (see my blog in Internal News Blog for further information)