MATCHINGS AND DELTA-MATROIDS

被引:38
作者
BOUCHET, A
机构
关键词
D O I
10.1016/0166-218X(92)90272-C
中图分类号
O29 [应用数学];
学科分类号
070104 [应用数学];
摘要
引用
收藏
页码:55 / 62
页数:8
相关论文
共 10 条
[1]
THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH [J].
BALAS, E ;
PULLEYBLANK, W .
NETWORKS, 1983, 13 (04) :495-516
[2]
GREEDY ALGORITHM AND SYMMETRICAL MATROIDS [J].
BOUCHET, A .
MATHEMATICAL PROGRAMMING, 1987, 38 (02) :147-159
[3]
Brualdi RA, 1969, B AUSTR MATH SOC, V1, P161, DOI DOI 10.1017/S000497270004140X
[4]
CUNNINGHAM WH, 1986, COMMUNICATION
[5]
PATHS TREES AND FLOWERS [J].
EDMONDS, J .
CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&
[6]
Edmonds J., 1969, COMBINATORIAL STRUCT, P69
[7]
KROGDAHL S, 1978, ALGEBRAIC METHODS GR, P495
[8]
Lovasz L, 1986, MATCHING THEORY ANN, V29
[9]
Tutte W. T., 1947, J LOND MATH SOC, V22, P107, DOI DOI 10.1112/JLMS/S1-22.2.107
[10]
Welsh D.J.A., 1976, MATROID THEORY