From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Hypergraphs - combinatorics of finite sets.

C. Berge. North-Holland mathematical library North-Holland, (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Graphes et hypergraphesC. Berge. Monographies universitaires de mathématiques Dunod, Paris, (1970)Hypergraphes : combinatoire des ensembles finisC. Berge. Gauthier-Villars, (1987)HypergraphsC. Berge. (1989)Balanced matrices.C. Berge. Math. Program., 2 (1): 19-31 (1972)Combinatorial games on a graph.C. Berge. Discret. Math., 151 (1-3): 59-65 (1996)A combinatorial problem in logic.C. Berge, и A. Rao. Discret. Math., 17 (1): 23-26 (1977)On the optimal transversals of the odd cycles.C. Berge, и J. Fouquet. Discret. Math., 169 (1-3): 169-175 (1997)Equipartite colorings in graphs and hypergraphs.C. Berge, и F. Sterboul. J. Comb. Theory, Ser. B, 22 (2): 97-113 (1977)Combinatorial properties of polyominoes.C. Berge, C. Chen, V. Chvátal, и C. Seow. Combinatorica, 1 (3): 217-224 (1981)Preface.C. Berge. Discret. Math., 111 (1-3): 1 (1993)