Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. J. Cheriyan, A. Sebő, Z. Szigeti, An improved approximation algorithm for the minimum 2-edge-connected spanning subgraph problem, Proceedings of IPCO6, eds.: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado, (1998) 126–136.
2. J. Edmonds, L. Lovász, W. R. Pulleyblank, Brick decompositions and the matching rank of graphs, Combinatorica
2 (1982) 247–274.
3. A. Frank, Conservative weightings and ear-decompositions of graphs, Combinatorica
13(1)(1993) 65–81.
4. C.H.C. Little, A theorem on connected graphs in which every edge belongs to a 1-factor, J. Austral. Math. Soc.
18 (1974) 450–452.
5. L. Lovász, A note on factor-critical graphs, Studia Sci. Math. Hungar.
7 (1972) 279–280.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献