An algorithm for finding clique cut-sets
From MaRDI portal
Cites work
Cited in
(50)- Decomposition by clique separators
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Intersection graphs of paths in a tree
- Recognizing claw-free perfect graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- A description of claw-free perfect graphs
- On stable cutsets in line graphs
- On stable cutsets in graphs
- An introduction to clique minimal separator decomposition
- The sandwich problem for decompositions and almost monotone properties
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- Compositions for perfect graphs
- Covering graphs with convex sets and partitioning graphs into convex sets
- Tree-decompositions with bags of small diameter
- More results on weighted independent domination
- Matrix partitions of perfect graphs
- On asteroidal sets in chordal graphs
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Skew partitions in perfect graphs
- Ninth and tenth order virial coefficients for hard spheres in D dimensions
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
- Graph partitions with prescribed patterns
- Decomposability of abstract and path-induced convexities in hypergraphs
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Skew partition sandwich problem is NP-complete
- Minimal disconnected cuts in planar graphs
- The Maximum Independent Set Problem in Planar Graphs
- Organizing the atoms of the clique separator decomposition into an atom tree
- On graphs with no induced subdivision of \(K_4\)
- Revisiting decomposition by clique separators
- On the choosability of claw-free perfect graphs
- scientific article; zbMATH DE number 2230229 (Why is no real title available?)
- Hard graphs for the maximum clique problem
- Strong cliques in diamond-free graphs
- Combining decomposition approaches for the maximum weight stable set problem
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Parameterizing cut sets in a graph by the number of their components
- Which claw-free graphs are perfectly orderable?
- Testing balancedness and perfection of linear matrices
- A characterization of minimally connected graphs without 2-clique cutsets
- Graphs without large apples and the maximum weight independent set problem
- Stable sets and graphs with no even holes
- Clique or hole in claw-free graphs
- Weakly triangulated graphs
- List matrix partitions of chordal graphs
- A new characterization of unichord-free graphs
- The maximum infection time in the geodesic and monophonic convexities
- On stable cutsets in claw-free graphs and planar graphs
- Complexity results related to monophonic convexity
This page was built for publication: An algorithm for finding clique cut-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149784)
