Martin Tancer. d-collapsibility is NP-complete for d>=4. Electronic Notes in Discrete Mathematics, 34:53-57, 2009. [doi]
@article{Tancer09, title = {d-collapsibility is NP-complete for d>=4}, author = {Martin Tancer}, year = {2009}, doi = {10.1016/j.endm.2009.07.009}, url = {http://dx.doi.org/10.1016/j.endm.2009.07.009}, tags = {completeness}, researchr = {https://researchr.org/publication/Tancer09}, cites = {0}, citedby = {0}, journal = {Electronic Notes in Discrete Mathematics}, volume = {34}, pages = {53-57}, }