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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 156; s. 103723
Hlavní autori:	Le, Hoang-Oanh, Le, Van Bang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.03.2026
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!