On the number of distinct minimal clique partitions and clique covers of a line graph (Q1813995): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: R. S. Rees / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
| Property / author | |||
| Property / author: R. S. Rees / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique partitions of the cocktail party graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4152571 / rank | |||
Normal rank | |||
Latest revision as of 09:31, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of distinct minimal clique partitions and clique covers of a line graph |
scientific article |
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
