Recognising a partitionable simplicial complex is in NP

We show that the problem of recognising a partitionable simplicial complex is a member of the complexity class NP, thus answering a question raised in [1