๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number

โœ Scribed by Sukegawa, Noriyoshi; Miyauchi, Atsushi


Book ID
122061858
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
312 KB
Volume
10
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the number of distinct minimal clique
โœ Sean McGuinness; Rolf Rees ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab