$\mathcal{P}$-matchings Parameterized by Treewidth
From MaRDI portal
Publication:6444177
DOI10.1007/978-3-031-43380-1_16arXiv2307.09333OpenAlexW4386974175MaRDI QIDQ6444177
Publication date: 18 July 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-43380-1_16
Related Items (3)
On the complexity of minimum maximal acyclic matchings ⋮ Minimum maximal acyclic matching in proper interval graphs ⋮ Parameterized results on acyclic matchings with implications for related problems
This page was built for publication: $\mathcal{P}$-matchings Parameterized by Treewidth
