The following pages link to Shellability is NP-complete (Q5115809):
Displaying 10 items.
- Recognising a partitionable simplicial complex is in \(\text{NP}\) (Q1917504) (← links)
- Counting shellings of complete bipartite graphs and trees (Q2045057) (← links)
- Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← links)
- Decomposable clutters and a generalization of Simon's conjecture (Q2419475) (← links)
- \(h\)-assignments of simplicial complexes and reverse search (Q2489953) (← links)
- \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437) (← links)
- Recognizing shrinkable complexes is NP-complete (Q2970458) (← links)
- LaserTank is NP-Complete (Q5014691) (← links)
- Shellability is NP-complete (Q5115809) (← links)
- Hyperplane Neural Codes and the Polar Complex (Q5118374) (← links)