Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Anderson, I.: Perfect matchings of a graph. J. Combinatorial Theory10, 183?186 (1971).
2. Beineke, L., Plummer, M.: On the 1-factors of a non-separable graph. J. Combinatorial Theory2, 285?289 (1967).
3. Berge, C.: Sur le couplage maximum d'un graphe. C.R. Acad. Sciences247, 258 (1958).
4. Halin, R.: A theorem onn-connected graphs. J. Combinatorial Theory7, 150?154 (1969).
5. Halin, R.: Zur Theorie dern-fach zusammenhängenden Graphen. Abh. Math. Sem. Univ. Hamburg33, 133?164 (1969).
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献