𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms on clique separable graphs

✍ Scribed by Fǎnicǎ Gavril

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
925 KB
Volume
19
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We define a family of graphs. tailed the clique sepambk graphs. characterized by the fact that they have completely connected rut sets by which we decompose them into r)arts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal gmphs and the i-trkmgulated prtJphs are clique separable lgraphs. The purpose of this paper is to describe polynomial time +orithms for the recognition of tale clique separable grzrphs and for finding them a minimum coloring and a m.Mmum clique.

📜 SIMILAR VOLUMES

An algorithm for the decomposition of gr
An algorithm for the decomposition of graphs into cliques
✍ Xiang-Ying Su 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract Chung (F. R. K. Chung, On the decomposition of graphs, __SIAM J. Algebraic Discrete Methods__ 23 (1981), 1–12.) and independently Györi and Kostochka (E. Györi and A. V. Kostochka, On a problem of G. O. H. Katona and T. Tarján, __Acta Math. Acad. Sci. Hung.__ 34 (1979), 321–327.) proved

On clique-extremal (p,q)-graphs
On clique-extremal (p,q)-graphs
✍ F. Harary; A. Lempel 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract A clique of a graph is a maximal complete subgraph. A (p,q)‐graph has p points and q lines. A clique‐extremal (p,q)‐graph has either the maximum or the minimum number of cliques among all (p,q)‐graphs. Moon and Moser have determined constructively the maximum number of cliques in a p‐po

On clique partitions of split graphs
On clique partitions of split graphs
✍ W.D. Wallis; J. Wu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

On iterated clique graphs with increasin
On iterated clique graphs with increasing diameters
✍ C. Peyrat; D. F. Rall; P. J. Slater 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

We examine the problem of finding a graph G whose nth iterated clique graph has diameter equal to the diameter of G plus n.