Abstract
Results of Tutte and of Anderson giving conditions for a simple graph G to have a perfect matching are generalized to give conditions for G to have a matching of defect d. A corollary to one of these results is a theorem of Berge on the size of a maximum matching in G.
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. Sur le couplage maximum d'un graphe;Berge;C.R. Acad. Sci. Paris,1958
2. The Factorization of Linear Graphs
3. Perfect matchings of a graph
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Factors and factorizations of graphs—a survey;Journal of Graph Theory;1985
2. Matchings in pentagonal chains;Discrete Applied Mathematics;1984-04
3. Matchings in graphs II;Discrete Mathematics;1975
4. On defect-d matchings in graphs;Discrete Mathematics;1975
5. The binding number of a graph and its Anderson number;Journal of Combinatorial Theory, Series B;1973-12