On the Complexity of Matching Cut in Graphs of Fixed Diameter.

Hong-Oanh Le, Van Bang Le

Browse the full ISAAC paper archive.