Recognizing decomposable graphs
From MaRDI portal
Publication:3320412
DOI10.1002/jgt.3190080106zbMath0536.05030OpenAlexW2082548475MaRDI QIDQ3320412
No author found.
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080106
Related Items (41)
Stable skew partition problem ⋮ Vertex partitioning problems on graphs with bounded tree width ⋮ \(\ell_p\)-norm multiway cut ⋮ Efficient algorithms for decomposing graphs under degree constraints ⋮ Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs ⋮ Algorithms Solving the Matching Cut Problem ⋮ Minimal Disconnected Cuts in Planar Graphs ⋮ Parameterized complexity of perfectly matched sets ⋮ Finding matching cuts in \(H\)-free graphs ⋮ Degree-constrained 2-partitions of graphs ⋮ Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ On stable cutsets in line graphs ⋮ Algorithms solving the matching cut problem ⋮ Improper C-colorings of graphs ⋮ Finding perfect matching cuts faster ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Unnamed Item ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Parameterizing cut sets in a graph by the number of their components ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Matching cutsets in graphs of diameter 2 ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization ⋮ Complexity and kernels for bipartition into degree-bounded induced graphs ⋮ The sandwich problem for decompositions and almost monotone properties ⋮ The perfect matching cut problem revisited ⋮ The perfect matching cut problem revisited ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ Matching cut in graphs with large minimum degree ⋮ Unnamed Item ⋮ The complexity of the matching-cut problem for planar graphs and other graph classes ⋮ Extremal graphs having no matching cuts ⋮ On stable cutsets in graphs ⋮ Bisplit graphs ⋮ 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
Cites Work
This page was built for publication: Recognizing decomposable graphs
