2 votes
Accepted

Finding a Maximum Cut With Force Labeled Vertices for Planar Graphs

A special case of your problem, where the neighborhoods of the vertices you force together are disjoint, is equivalent to solving (regular) Max-Cut on an apex graph (a graph that is planar, save for ...
Highheath's user avatar
  • 1,031

Only top scored, non community-wiki answers of a minimum length are eligible