Algorithms on clique separable graphs

DOI10.1016/0012-365X(77)90030-9zbMath0378.05042OpenAlexW2013949481MaRDI QIDQ1246434

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (22)

Bounds for cell entries in contingency tables given marginal totals and decomposable graphs ⋮ Efficient algorithms for minimum weighted colouring of some classes of perfect graphs ⋮ Complexity of determining the maximum infection time in the geodetic convexity ⋮ Path parity and perfection ⋮ An introduction to clique minimal separator decomposition ⋮ Recognizing claw-free perfect graphs ⋮ Combining decomposition approaches for the maximum weight stable set problem ⋮ Maximum max-k-clique subgraphs in cactus subtree graphs ⋮ Finding induced paths of given parity in claw-free graphs ⋮ An algorithm for finding clique cut-sets ⋮ Classes of perfect graphs ⋮ Revisiting Decomposition by Clique Separators ⋮ Some properties of graph centroids ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ Skew partitions in perfect graphs ⋮ Complexity results related to monophonic convexity ⋮ The complexity of generalized clique covering ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ A note on a conjecture by Gavril on clique separable graphs ⋮ A description of claw-free perfect graphs ⋮ Decomposition by clique separators ⋮ Perfectly contractile graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Triangulated graphs and the elimination process
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Algorithms on clique separable graphs