The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.

Paul S. Bonsma

Browse the full WG paper archive.