Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
From MaRDI portal
Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
Cites work
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- Algorithms solving the matching cut problem
- scientific article; zbMATH DE number 1202982 (Why is no real title available?)
- scientific article; zbMATH DE number 1052322 (Why is no real title available?)
- Matching cut in graphs with large minimum degree
- Matching cutsets in graphs
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- On the complexity of k-SAT
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- Recognizing decomposable graphs
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- The perfect matching cut problem revisited
- Which problems have strongly exponential complexity?
Cited in
(9)- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Finding d-cuts in probe H-free graphs
- Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
- Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs
- Matching cut and variants on bipartite graphs of bounded radius and diameter
- Matching cuts in graphs of high girth and H-free graphs
- Matching cuts in graphs of high girth and \(H\)-free graphs
- Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs
- Finding d-cuts in claw-free graphs
This page was built for publication: Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496556)
