Matchings in graphs
- 1 August 1973
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 9 (1) , 141-143
- https://doi.org/10.1017/s0004972700042982
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.Keywords
This publication has 2 references indexed in Scilit:
- Perfect matchings of a graphJournal of Combinatorial Theory, Series B, 1971
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947