We present a new algorithmn to solve the Max Cut problem in the class of graphs embeddable on an arbitrary orientable surface.
