𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of the Matching-cut Problem for Various Graph Classes

✍ Scribed by Paul Bonsma

Book ID
108498019
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
228 KB
Volume
13
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg