Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths

DOI10.1007/978-3-031-43380-1_30MaRDI QIDQ6496556

Hoàng-Oanh Le, Van Bang Le

Publication date: 3 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths