DOMINATION, INDEPENDENT DOMINATION, AND DUALITY IN STRONGLY CHORDAL GRAPHS

被引：140

作者：

FARBER, M

机构：

来源：

关键词：

D O I：

10.1016/0166-218X(84)90061-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：115 / 130

页数：16

共 24 条

[1]

ANSTEE RP, UNPUB J ALGORITHMS

[2]

Berge C, 1972, MATH PROGRAM, V2, P19, DOI 10.1007/BF01584535

[3]

BEYER T, 1977, 8TH P SE C COMB GRAP, P321

[4] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

[5]

CHANG GJ, 1982, TR540 CORN U SCH ORI

[6]

CHANG GJ, 1982, COMMUNICATION

[7]

Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

[8]

Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305

[9] CHARACTERIZATIONS OF STRONGLY CHORDAL GRAPHS [J].

FARBER, M .

[10]

Farber M., 1982, Operations Research Letters, V1, P134, DOI 10.1016/0167-6377(82)90015-3