1 paper
Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai
We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the co…