Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Paul S. Bonsma. The Complexity of the Matching-cut Problem for Various Graph Classes. Electronic Notes in Discrete Mathematics, 13:18-21, 2003. [doi]
Abstract is missing.