abstract: The classical Steinitz's theorem asserts that a graph G is the underlying graph of a 3-polytope if and only if G is 3-connected and planar. In 1961, Balinski extended the "only if" direction of Steinitz's theorem by showing that the underlying graph of a d-polytope is d-connected. In this talk, based on a recent joint work with Karim Adiprasito and Matteo Varbaro and a work in progress with Anders Bj\"{o}rner, I will present several generalisations of Balinski's theorem. If time permits an application to finite Coxeter groups will be given.