1. Berge, C., C. R. Acad. Sci. Paris Ser. I Math. 247, 258–259 (1958) and Graphs and Hypergraphs (Chap. 8, Theorem 12), North-Holland, Amsterdam (1973)
2. Biedl, T., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G.: Tight bounds on maximal and maximum matchings. Discrete Math. 285, 7–15 (2004)
3. Frendrup, A., Vestergaard, P.D., Yeo, A.: Total domination in partitioned graphs. Submitted.
4. Lichiardopol, N.: Lower bounds on the matching number of regular graphs, manuscript, July 4, (2004)
5. Plummer, M.: Factors and Factorization. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory. CRC Press, pp. 403–430 (2003), ISBN: 1-58488-092-2