The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes (Extended Abstract)


Share/Save/Bookmark

Bonsma, Paul (2003) The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes (Extended Abstract). In: 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG, June 19-21, 2003, Elspeet, The Netherlands.

[img]PDF
Restricted to UT campus only
: Request a copy
172Kb
Abstract:The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Chvátal studied this problem under the name of the Decomposable Graph Recognition problem, and proved the problem to be -complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. In this paper it is shown that the problem is -complete when restricted to planar graphs with girth 5 and planar graphs with maximum degree 4. In addition, for claw-free graphs and planar graphs with girth at least 7 polynomial algorithms to find matching-cuts are described.
Item Type:Conference or Workshop Item
Copyright:© 2003 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/72724
Official URL:http://dx.doi.org/10.1007/978-3-540-39890-5_9
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 214384