Max Bisection problem is to partition the set of nodes into two equal size sets such that the number of crossing edges is maximum. Max Bisection is $NP$-complete on cubic graphs and also on planar graphs.
What is the complexity of Max Bisection on cubic planar graphs? Is it $NP$-complete?
Cross posted on mathOverflow