TREE GRAPH OF A MATROID

被引：48

作者：

HOLZMANN, CA

HARARY, F

机构：

来源：

关键词：

D O I：

10.1137/0122021

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：187 / &

共 13 条

[1] HAMILTON CIRCUITS IN TREE GRAPHS [J].

CUMMINS, RL .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (01) :82-&

[2] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :67-+

[3]

Harary F., 1969, MANY FACETS GRAPH TH, V110, P155, DOI 10.1007/BFb0060114

[4]

Harary F., 1969, GRAPH THEORY, DOI [DOI 10.1201/9780429493768, DOI 10.21236/AD0705364]

[5]

KAMAE T, 1967, IEEE T CIRCUIT THEOR, VCT14, P279

[6]

KISHI G, 1968, IEEE T CIRCUIT THEOR, VCT15, P42

[7]

KISHI G, 1968, IEEE T CIRCUIT THEOR, VCT15, P271

[8]

LAWLER E, TO BE PUBLISHED

[9]

MINTY GJ, 1966, J MATH MECH, V15, P485

[10]

Rado R., 1942, Q J MATH OXFORD, V13, P83