On total matching numbers and total covering numbers of complementary graphs
✍ Scribed by P. Erdös; A. Meir
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 455 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set
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 n