NP-hardness of computing PL geometric category in dimension 2

Michael Skotnica, Martin Tancer

The PL geometric category of a polyhedron $P$, denoted $plgcat(P)$, provides a natural upper bound for the Lusternik--Schnirelmann category and it is defined as the minimum…