Discrete Mathematics 232 (2001), 47-58.

Deciding constructibility of 3-balls with few interior vertices

by Masahiro Hachimori


In this paper, we treat the decision problem of constructibility. This problem was solved only under the condition that the given simplicial complex is a triangulated 3-ball with all the vertices on the boundary. Here we extend this result to the case that the triangulated 3-ball has at most two interior vertices.