Algorithms on clique separable graphs
From MaRDI portal
Publication:1246434
DOI10.1016/0012-365X(77)90030-9zbMATH Open0378.05042OpenAlexW2013949481MaRDI QIDQ1246434FDOQ1246434
Authors: Fanica Gavril 
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(77)90030-9
Cites Work
- Title not available (Why is that?)
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- On rigid circuit graphs
- Triangulated graphs and the elimination process
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- Path parity and perfection
- Decomposition by clique separators
- Combining decomposition approaches for the maximum weight stable set problem
- An algorithm for finding clique cut-sets
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Complexity results related to monophonic convexity
- An introduction to clique minimal separator decomposition
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Revisiting decomposition by clique separators
- The complexity of generalized clique covering
- A description of claw-free perfect graphs
- Complexity of determining the maximum infection time in the geodetic convexity
- Skew partitions in perfect graphs
- Classes of perfect graphs
- Perfectly contractile graphs
- Some properties of graph centroids
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Recognizing claw-free perfect graphs
- A note on a conjecture by Gavril on clique separable graphs
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
- On stable cutsets in claw-free graphs and planar graphs
- Finding induced paths of given parity in claw-free graphs
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)
