Hoàng-Oanh Le, Van Bang Le. Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths. In Daniël Paulusma, Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Volume 14093 of Lecture Notes in Computer Science, pages 417-431, Springer, 2023. [doi]
Abstract is missing.