The complexity of the Perfect Matching-Cut problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

The complexity of the Perfect Matching-Cut problem

Résumé

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that is an edge cut. We show that this problem is $NP$-complete for planar graphs with maximum degree four, for planar graphs with girth five, for bipartite five-regular graphs, for graphs of diameter three and for bipartite graphs of diameter four. We show that there exist polynomial time algorithms for the following classes of graphs: claw-free, $P_5$-free, diameter two, bipartite with diameter three, quadrangulated and graphs with bounded tree-width.

Dates et versions

hal-02995237 , version 1 (09-11-2020)

Identifiants

Citer

Valentin Bouquet, Christophe Picouleau. The complexity of the Perfect Matching-Cut problem. 2020. ⟨hal-02995237⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More