Neighborhood Complex Connectedness Algorithm

39 Views Asked by At

Is there an algorithm that can decide, wether the polyhedron of a neighborhood complex (as defined here) of a given finite graph is simply connected? There is no such algorithm for arbitrary simplicial complexes, see k-connectedness of simplicial complexes.