Te-Cheng Liu

collaborators

2 papers

cs.CC2026

Determining the Outerthickness of Graphs Is NP-Hard

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…

math.CO2025

Cyclic subsets of tournaments

Zach Hunter, Teng Liu, Aleksa MilojeviÄ +1

Let $G$ be a Dirac graph, and let $S$ be a vertex subset of $G$ , chosen uniformly at random. How likely is the induced subgraph $G [S]$ to be Hamiltonian? This question, proposed by…