Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths.

Hong-Oanh Le, Van Bang Le

Browse the full WG paper archive.