Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles

In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. matching cut (mc), respectively, perfect matching cut (pmc), is the problem of deciding whether a given graph has a matching cut, respectively, a perfect matching cut. The disconnected perfect matching problem (dpm) is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 156; S. 103723
Hauptverfasser:	Le, Hoang-Oanh, Le, Van Bang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.03.2026
Schlagworte:	Computational complexity Disconnected perfect matching H-free graph k-chordal graph Matching cut Perfect matching cut H-free graph Matching cut Disconnected perfect matching k-chordal graph Perfect matching cut Computational complexity
ISSN:	0022-0000
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!