Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles

Hoàng-Oanh Le, Van Bang Le. Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles. J. Comput. Syst. Sci., 156:103723, 2026. [doi]

Abstract

Abstract is missing.