A note on Matching-Cut in $P_t$-free Graphs
From MaRDI portal
Publication:6383772
DOI10.1016/J.IPL.2022.106294zbMath1529.68209arXiv2111.12011MaRDI QIDQ6383772
Publication date: 23 November 2021
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: A note on Matching-Cut in $P_t$-free Graphs