A set-pair Lovasz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.