The complexity of the matching-cut problem for planar graphs and other graph classes

P.S. Bonsma

Research output: Contribution to journalArticleAcademic

37 Citations (Scopus)
4 Downloads (Pure)

Fingerprint

Dive into the research topics of 'The complexity of the matching-cut problem for planar graphs and other graph classes'. Together they form a unique fingerprint.