Families of graphs for which MAXCUT values is known?

47 Views Asked by At

The max-cut (https://en.wikipedia.org/wiki/Maximum_cut) is NP-hard in general. However can we enumerate the families of graphs for which the value is known explicitly? For example a bipartite graph's max-cut would be trivial.

1

There are 1 best solutions below

1
On

I would comment, but I cannot yet.

I suggest you this website, which is basically a database of all graph classes important enough to be even defined.

Specially, you can see their complexity towards the $MAXCUT$ problem listed here.