论文信息 - Algorithms on clique separable graphs

Algorithms on clique separable graphs

Abstract We define a family of graphs, called the clique separable graphs , characterized by the fact that they have completely connected cut sets by which we decompose them into parts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal graphs and the i -triangulated graphs are clique separable graphs. The purpose of this paper is to describe polynomial time algorithms for the recognition of the clique separable graphs and for finding them a minimum coloring and a maximum clique.

Fanica Gavril | F. Gavril

[1] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[3] G. Dirac. On rigid circuit graphs , 1961 .

[4] D. Rose. Triangulated graphs and the elimination process , 1970 .

[5] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..