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

P.S. Bonsma (Speaker)

Activity: Talk or presentationOral presentation


Plaats van uitgifte: Elspeet, The Netherlands
Period21 Jun 2003
Event title29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003
Event typeWorkshop
Conference number29
LocationElspeet, Netherlands


  • METIS-214382