The maximum cardinality cut (MaxCut) problem remains NP-complete for co-bipartite graphs and
 split graphs. Based on modular decomposition, in [3] it is shown that MaxCut polynomial-time solvable are factorable to bounded treewidth However, this approach fails because the modules of a graph exactly twins and connected components. In work we extend result using concept bimodules bimodular d...