Matching cutsets in graphs
From MaRDI portal
Recommendations
- The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract)
- scientific article; zbMATH DE number 2044946
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Matching cutsets in graphs of diameter 2
- Algorithms Solving the Matching Cut Problem
Cites work
Cited in
(51)- On stable cutsets in line graphs
- On stable cutsets in graphs
- On structural parameterizations of the matching cut problem
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- The sandwich problem for decompositions and almost monotone properties
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Complexity results for two kinds of colored disconnections of graphs
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- Vertex partitioning problems on graphs with bounded tree width
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Matching of 5- -critical leafless graph with a cut edge
- Decycling with a matching
- Discontinuities in the complexities of some graph recognition problems
- Algorithms Solving the Matching Cut Problem
- Extremal graphs having no matching cuts
- A characterization of extremal graphs with no matching-cut
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Secure sets and their expansion in cubic graphs
- Cutsets in bipartite graphs*
- scientific article; zbMATH DE number 2044944 (Why is no real title available?)
- scientific article; zbMATH DE number 2044946 (Why is no real title available?)
- scientific article; zbMATH DE number 874369 (Why is no real title available?)
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract)
- The perfect matching cut problem revisited
- Matching cut in graphs with large minimum degree
- The perfect matching cut problem revisited
- Parameterized complexity of perfectly matched sets
- Finding matching cuts in \(H\)-free graphs
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
- 3-consecutive edge coloring of a graph
- Cutting Barnette graphs perfectly is hard
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- The complexity of the perfect matching-cut problem
- Finding d-cuts in probe H-free graphs
- On polynomial kernelization for stable cutset
- 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 cuts in graphs of high girth and H-free graphs
- Matching cuts in graphs of high girth and \(H\)-free graphs
- Parameterized complexity of perfectly matched sets
- Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs
- On polynomial kernelization for stable cutset
- Matching (multi)cut: algorithms, complexity, and enumeration
- Complexity framework for forbidden subgraphs. II: Edge subdivision and the ``H-graphs
- Finding d-cuts in claw-free graphs
- Algorithms solving the matching cut problem
- On stable cutsets in claw-free graphs and planar graphs
- Matching cutsets in graphs of diameter 2
- Satisfactory graph partition, variants, and generalizations
This page was built for publication: Matching cutsets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203060)
