Recognizing decomposable graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 25257
- scientific article; zbMATH DE number 1156583
- scientific article; zbMATH DE number 47528
- Set recognition of decomposable graphs and steps towards their reconstruction
- Indecomposability graph and indecomposability recognition
- scientific article; zbMATH DE number 4016946
- scientific article; zbMATH DE number 4122031
- On decomposition of graphs
- Graphical decompositions
- scientific article; zbMATH DE number 3845624
Cites work
Cited in
(72)- Recognizing Cartesian graph bundles
- On stable cutsets in line graphs
- On stable cutsets in graphs
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- The sandwich problem for decompositions and almost monotone properties
- Stable skew partition problem
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- A note on matching-cut in \(P_t\)-free graphs
- An FPT algorithm for matching cut and d-cut
- Vertex partitioning problems on graphs with bounded tree width
- _p-norm multiway cut
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- A degree bound on decomposable trees
- Degree-constrained 2-partitions of graphs
- Bisplit graphs
- Set recognition of decomposable graphs and steps towards their reconstruction
- Perfectly matched sets in graphs: parameterized and exact computation
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Algorithms Solving the Matching Cut Problem
- Minimal disconnected cuts in planar graphs
- Extremal graphs having no matching cuts
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Input-output decomposition of dynamic systems is NP-complete
- scientific article; zbMATH DE number 4110748 (Why is no real title available?)
- Recognizing Greedy Structures
- scientific article; zbMATH DE number 887768 (Why is no real title available?)
- scientific article; zbMATH DE number 7378605 (Why is no real title available?)
- scientific article; zbMATH DE number 2230235 (Why is no real title available?)
- Graph theory (algorithmic, algebraic, and metric problems)
- 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
- Finding perfect matching cuts faster
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Improper C-colorings of graphs
- Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
- Parameterizing cut sets in a graph by the number of their components
- Cutting Barnette graphs perfectly is hard
- On conflict-free cuts: algorithms and complexity
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Exact and parameterized algorithms for the independent cutset problem
- 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
- Revisiting extremal graphs having no stable cutsets
- Matching cut and variants on bipartite graphs of bounded radius and diameter
- Matching cuts in graphs of high girth and H-free graphs
- Partition of graphs with maximum degree ratio
- Matching cuts in graphs of high girth and \(H\)-free graphs
- Parameterized complexity of perfectly matched sets
- Forest cuts in sparse graphs
- Sparse vertex cutsets and the maximum degree
- Finding \(d\)-cuts in graphs of bounded diameter, graphs of bounded radius and \(H\)-free graphs
- On polynomial kernelization for stable cutset
- Complexity framework for forbidden subgraphs. I: The framework
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Matching (multi)cut: algorithms, complexity, and enumeration
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Faster exponential algorithms for cut problems via geometric data structures
- Efficient algorithms for decomposing graphs under degree constraints
- 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: Recognizing decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320412)
