Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles

Matching cut, perfect matching cut, and disconnected perfect matching problems are NP-complete in graphs without induced paths of length 14 or longer, and can be solved in polynomial time in 4-chordal graphs.