Finding matching cuts in \(H\)-free graphs

From MaRDI portal
Publication:6046951

DOI10.1007/s00453-023-01137-9arXiv2207.07095OpenAlexW4379796487MaRDI QIDQ6046951

Daniël Paulusma, Felicia Lucke, Bernard Ries

Publication date: 6 October 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.07095




Related Items (1)



Cites Work


This page was built for publication: Finding matching cuts in \(H\)-free graphs