THE K-DOMINATION AND K-STABILITY PROBLEMS ON SUN-FREE CHORDAL GRAPHS

被引：114

作者：

CHANG, GJ ^{[1
]}

NEMHAUSER, GL ^{[1
]}

机构：

[1] CORNELL UNIV,COLL ENGN,SCH OPERAT RES & IND ENGN,ITHACA,NY 14853

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1984年 / 5卷 / 03期

关键词：

D O I：

10.1137/0605034

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：332 / 345

页数：14

共 34 条

[1] BOUNDS FOR THE COVERING NUMBER OF A GRAPH [J].

ABBOTT, HL ;

LIU, AC .

[2]

BALAKRISHNAN R, 1982, UNPUB AUSTR J MATH

[3]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

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

BOOTH, KS ;

JOHNSON, JH .

[5]

Booth KS, 1980, CS8034 U WAT

[6]

Buneman P., 1974, Discrete Mathematics, V9, P205, DOI 10.1016/0012-365X(74)90002-8

[7]

Chang G. J., 1982, Operations Research Letters, V1, P214, DOI 10.1016/0167-6377(82)90024-4

[8]

CHANG GJ, 1982, 551 CORN U SCH OR IE

[9]

CHANG GJ, 1982, THESIS CORNELL U ITH

[10]

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