d-collapsibility is NP-complete for d greater or equal to 4

Martin Tancer. d-collapsibility is NP-complete for d greater or equal to 4. Chicago J. Theor. Comput. Sci., 2010, 2010. [doi]

Abstract

Abstract is missing.