An algorithm for finding clique cut-sets
From MaRDI portal
Publication:1149784
DOI10.1016/0020-0190(81)90072-7zbMath0454.68078OpenAlexW1991410678MaRDI QIDQ1149784
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90072-7
Related Items
Intersection graphs of paths in a tree, Tree-decompositions with bags of small diameter, An introduction to clique minimal separator decomposition, Recognizing claw-free perfect graphs, More results on weighted independent domination, Minimal Disconnected Cuts in Planar Graphs, Combining decomposition approaches for the maximum weight stable set problem, A new characterization of unichord-free graphs, Organizing the atoms of the clique separator decomposition into an atom tree, On stable cutsets in line graphs, The maximum infection time in the geodesic and monophonic convexities, Maximum max-k-clique subgraphs in cactus subtree graphs, Matrix partitions of perfect graphs, Revisiting Decomposition by Clique Separators, On graphs with no induced subdivision of \(K_4\), Parameterizing cut sets in a graph by the number of their components, On asteroidal sets in chordal graphs, On stable cutsets in claw-free graphs and planar graphs, Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs, On the choosability of claw-free perfect graphs, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Which claw-free graphs are perfectly orderable?, Hard graphs for the maximum clique problem, Testing balancedness and perfection of linear matrices, The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem, Skew partitions in perfect graphs, The computational complexity of disconnected cut and \(2 K_2\)-partition, Compositions for perfect graphs, Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions, The Maximum Independent Set Problem in Planar Graphs, The sandwich problem for cutsets: clique cutset, \(k\)-star cutset, Complexity results related to monophonic convexity, Graph partitions with prescribed patterns, The sandwich problem for decompositions and almost monotone properties, Decomposability of abstract and path-induced convexities in hypergraphs, Strong cliques in diamond-free graphs, Graphs without large apples and the maximum weight independent set problem, Maximum independent sets in subcubic graphs: new results, Stable sets and graphs with no even holes, Covering graphs with convex sets and partitioning graphs into convex sets, Clique or hole in claw-free graphs, Unnamed Item, Skew partition sandwich problem is NP-complete, On stable cutsets in graphs, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, A description of claw-free perfect graphs, Weakly triangulated graphs, Decomposition by clique separators, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, List matrix partitions of chordal graphs
Cites Work
