ON K-OPTIMUM DIPATH PARTITIONS AND PARTIAL K-COLORINGS OF ACYCLIC DIGRAPHS

被引：9

作者：

CAMERON, K ^{[1
]}

机构：

[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1016/S0195-6698(86)80036-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：115 / 118

页数：4

共 17 条

[1]

Berge C., 1982, EUROPEAN J COMBIN, V3, P97, DOI DOI 10.1016/S0195-6698(82)80022-X

[2]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[3]

BONDY JA, 1976, GRAPH THEORY APPLICA

[4]

CAMERON K, 1982, THESIS U WATERLOO

[5]

CAMERON KB, UNPUB COFLOW POLYHED

[6] A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS [J].

DILWORTH, RP .

[7]

Edmonds J., 1975, ANN DISCRETE MATH, V1, P185

[8]

Ford L., 1962, FLOWS NETWORKS

[9] ON CHAIN AND ANTI-CHAIN FAMILIES OF A PARTIALLY ORDERED SET [J].

FRANK, A .

[10]

Gallai T., 1960, ACTA SCI MATH, V21, P181