1 paper
Alexander Metzger, Austin Ulrigg
We study the problem of determining the minimal genus of a simple finite connected graph. We present an algorithm which, for an arbitrary graph G with n vertices and m edges,…