On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of distinct minimal clique partitions and clique covers of a line graph |
scientific article; zbMATH DE number 5566 |
Statements
On the number of distinct minimal clique partitions and clique covers of a line graph (English)
0 references
25 June 1992
0 references
Let \(G\) be a graph. Then \(cc(G)\) \((cp(G))\), the clique covering (the clique partition) number of \(G\) is the minimum number of cliques of \(G\) that cover (partition) all edges of \textit{G. Orlin} [Nederl. Akad. Wet., Proc., Ser. A 80, Indag. Math. 39, 406-424 (1977; Zbl 0374.05041)] determined \(cc(G)\) and \(cp(G)\) in the case when \(G\) is a line graph. In this paper a constructive proof of the result is provided. Moreover, the number of distinct minimal clique covers (partitions) is given.
0 references
0.8758677840232849
0 references
0.8210582733154297
0 references
0.802781879901886
0 references
