Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We apply it to give new sufficient conditions for indecomposability of polytopes, and then illustrate them with some examples.