ON THE COMPUTATION OF THE COMPETITION NUMBER OF A GRAPH

被引：57

作者：

OPSUT, RJ

机构：

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 04期

关键词：

D O I：

10.1137/0603043

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：420 / 428

页数：9

共 16 条

[1]

[Anonymous], 1976, DISCRETE MATH MODELS

[2]

Cohen J. E, 1978, MONOGRAPHS POPULATIO

[3] FOOD WEBS AND DIMENSIONALITY OF TROPHIC NICHE SPACE [J].

COHEN, JE .

[4]

COHEN JE, 1966, MODEL SIMPLE COMPETI

[5]

COZZENS MB, 1981, UNPUB NP COMPLETENES

[6]

COZZENS MB, 1981, METEORIC 2K 1 TUPLES

[7]

COZZENS MB, UNPUB DISCRETE APPLI

[8]

GABAI H, 1974, BOUNDS BOXICITY GRAP

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[10]

HARARY F, 1965, STRUCTURAL MODELS IN