DOMINATION, INDEPENDENT DOMINATION, AND DUALITY IN STRONGLY CHORDAL GRAPHS

[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]. SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 191 - 199

[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]. DISCRETE MATHEMATICS, 1983, 43 (2-3) : 173 - 189

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

[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]. SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 191 - 199

[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]. DISCRETE MATHEMATICS, 1983, 43 (2-3) : 173 - 189

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