F-FACTORS OF GRAPHS - GENERALIZED MATCHING PROBLEM

被引:7
作者
MUHLBACHER, J
机构
关键词
decomposition of graphs; factor; Graph theory; matching;
D O I
10.1016/0020-0190(79)90026-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:207 / 214
页数:8
相关论文
共 6 条
[1]  
Berge, Graphs and Hypergraphs, (1973)
[2]  
Dorfler, Muhlbacher, Bestimmung eines maximalen Matching in beliebigen Graphen, Computing, 9, pp. 251-257, (1972)
[3]  
Dorfler, Muhlbacher, Ein verbesserter Matching-Algorithmus, Computing, 13, pp. 389-397, (1974)
[4]  
Gabow, An efficient implementation of Edmonds' algorithm for maximum matching on graphs, J. ACM, 23, pp. 221-234, (1976)
[5]  
Muhlbacher, Magische Quadrate und ihre Verallgemeinerung: ein graphentheoretisches Problem, Graphs, Datastructures, Algorithms, Appl. Comp. Sci., 13, (1978)
[6]  
Petersen, Die Theorie der regula¨ren Graphen, Acta Math., 15, pp. 193-220, (1891)