✦ LIBER ✦

On antichain intersection numbers, total clique covers and regular graphs

✍ Scribed by Morimasa Tsuchiya

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 742 KB
Volume: 127
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00487-c

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection numbers of 3-, 4-, j-regular graphs and some special graphs.

📜 SIMILAR VOLUMES

On clique covers and independence number

On clique covers and independence numbers of graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 485 KB

On total matching numbers and total cove

On total matching numbers and total covering numbers of complementary graphs

✍ P. Erdös; A. Meir 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 455 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ 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