MATCHINGS AND TRANSVERSALS IN HYPERGRAPHS, DOMINATION AND INDEPENDENCE IN TREES

被引：17

作者：

COCKAYNE, EJ ^{[1
]}

HEDETNIEMI, ST ^{[1
]}

SLATER, PJ ^{[1
]}

机构：

[1] SANDIA LABS,ALBUQUERQUE,NM 87185

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1979年 / 26卷 / 01期

关键词：

D O I：

10.1016/0095-8956(79)90044-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A family of hypergraphs is exhibited which have the property that the minimum cardinality of a transversal is equal to the maximum cardinality of a matching. A result concerning domination and independence in trees which generalises a recent result of Meir and Moon is deduced. © 1979.

引用

页码：78 / 80

页数：3