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

Brahim Chaourar

Published in: J. Comb. Optim. (2020)

Keyphrases

max cut
graph model
np hard
graph partitioning
planar graphs
np complete problems
spectral graph
np complete
special case
connected components
optimal solution
weighted graph