Algorithms on clique separable graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3214398 (Why is no real title available?)
- scientific article; zbMATH DE number 3267973 (Why is no real title available?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- On rigid circuit graphs
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Triangulated graphs and the elimination process
Cited in
(22)- A description of claw-free perfect graphs
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Combining decomposition approaches for the maximum weight stable set problem
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Perfectly contractile graphs
- Finding induced paths of given parity in claw-free graphs
- Revisiting decomposition by clique separators
- A note on a conjecture by Gavril on clique separable graphs
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Decomposition by clique separators
- Complexity results related to monophonic convexity
- An introduction to clique minimal separator decomposition
- An algorithm for finding clique cut-sets
- Recognizing claw-free perfect graphs
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
- Skew partitions in perfect graphs
- On stable cutsets in claw-free graphs and planar graphs
- Some properties of graph centroids
- Complexity of determining the maximum infection time in the geodetic convexity
- Classes of perfect graphs
- The complexity of generalized clique covering
- Path parity and perfection
This page was built for publication: Algorithms on clique separable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246434)
