1 paper
Cheng-Chen Tsai
A graph is hypohamiltonian if it is non-Hamiltonian, but the deletion of every single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph h…