Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$

Brahim Chaourar. Connected max cut is polynomial for graphs without the excluded minor $K_5\backslash e$. J. Comb. Optim., 40(4):869-875, 2020. [doi]

Abstract

Abstract is missing.