1. Tight bounds on maximal and maximum matchings;Biedl;Discrete Math.,2004
2. C. Biró, P. Horn, J. Wildstrom, personal communication.
3. Subtrees and subforests of graphs;Brandt;J. Combin. Theory B,1994
4. S.C. Cater, F. Harary, R.W. Robinson, One-color triangle avoidance games, in: Proc. 32nd SE Intl. Conf. Combin., Graph Theory and Comput. (Baton Rouge, 2001), Congr. Numer., 153, 2001, pp. 211–221.
5. A problem in graph theory;Erdős;Amer. Math. Monthly,1964