Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius

Lucke, Felicia; Paulusma, Daniël; Ries, Bernard

doi:10.1016/j.tcs.2024.114795

Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius

Lucke, Felicia; Paulusma, Daniël; Ries, Bernard

Authors

Felicia Lucke

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Bernard Ries

Citation

Lucke, F., Paulusma, D., & Ries, B. (2024). Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theoretical Computer Science, 1017, Article 114795. https://doi.org/10.1016/j.tcs.2024.114795

Journal Article Type	Article
Acceptance Date	Aug 13, 2024
Online Publication Date	Aug 20, 2024
Publication Date	Aug 20, 2024
Deposit Date	Sep 8, 2024
Publicly Available Date	Sep 9, 2024
Journal	Theoretical Computer Science
Print ISSN	0304-3975
Publisher	Elsevier
Peer Reviewed	Peer Reviewed
Volume	1017
Article Number	114795
DOI	https://doi.org/10.1016/j.tcs.2024.114795
Public URL	https://durham-repository.worktribe.com/output/2820655
Additional Information	This article is maintained by: Elsevier; Article Title: Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius; Journal Title: Theoretical Computer Science; CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.tcs.2024.114795; Content Type: article; Copyright: © 2024 The Author(s). Published by Elsevier B.V.