activity
20092026
most citedA complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

27 citations · 75 across the 18 of their papers we have counts for

collaborators
Showing 2023 · cs.CCShow all

1 paper · 2 filters

cs.CC2023

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

Hoang-Oanh Le, Van Bang Le

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…