𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The clique-partitioning problem

✍ Scribed by J. Bhasker; Tariq Samad

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
930 KB
Volume
22
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Clique partitions and clique coverings
Clique partitions and clique coverings
✍ Paul Erd'́os; Ralph Faudree; Edward T. Ordman πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 575 KB

Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow et-? times as fast as the clique covering number, where c is at least l/64. If in a clique on n vertices, the edges between cn" ve

Clique partitions of the cocktail party
Clique partitions of the cocktail party graph
✍ D.A Gregory; S McGuinness; W Wallis πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 369 KB

Let To denote the complement of a perfect matching in the complete graph on v vertices, v even, and let cp(To) be the minimum number of cliques needed to partition the edge-set of To. We prove that cp(To)>-v for v 1> 8 and give a design characterization of the cases where equality holds. We also sho

Algorithms for vertex-partitioning probl
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
✍ Michael U. Gerber; Daniel Kobler πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 189 KB

Many vertex-partitioning problems can be expressed within a general framework introduced by Telle and Proskurowski. They showed that optimization problems in this framework can be solved in polynomial time on classes of graphs with bounded tree-width. In this paper, we consider a very similar framew