Zhou, S., Liu, H. & Xu, Y. (2011). A Degree Condition For Graphs to Have Connected (g, f)-Factors. Bulletin of the Iranian Mathematical Society, 35(No. 1), 199–209.
MLA
Zhou, S., Liu, H., & Xu, Y. "A Degree Condition For Graphs to Have Connected (g, f)-Factors", Bulletin of the Iranian Mathematical Society, 35, No. 1, 2011, 199–209.
HARVARD
Zhou, S., Liu, H., & Xu, Y. (2011). 'A Degree Condition For Graphs to Have Connected (g, f)-Factors', Bulletin of the Iranian Mathematical Society, 35(No. 1), pp. 199–209.
CHICAGO
Zhou, S., Liu, H. & Xu, Y., "A Degree Condition For Graphs to Have Connected (g, f)-Factors." Bulletin of the Iranian Mathematical Society, 35 No. 1 (2011): 199–209,
VANCOUVER
Zhou S., Liu H., Xu Y. A Degree Condition For Graphs to Have Connected (g, f)-Factors. BIMS. 2011;35(No. 1):199–209.
