On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs

DOI10.1016/j.tcs.2022.09.014arXiv2204.07129MaRDI QIDQ6396539

Felicia Lucke, Bernard Ries, Daniël Paulusma

Publication date: 14 April 2022

Mathematics Subject Classification ID

Theory of computing (68Qxx)