APA (7th ed.) Citation

Hong, Z., Xia, Z., Chen, F., & Volkmann, L. Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected. Wiley.

Chicago Style (17th ed.) Citation

Hong, Zhen-Mu, Zheng-Jiang Xia, Fuyuan Chen, and Lutz Volkmann. Sufficient Conditions for Graphs to Be K-Connected, Maximally Connected, and Super-Connected. Wiley.

MLA (9th ed.) Citation

Hong, Zhen-Mu, et al. Sufficient Conditions for Graphs to Be K-Connected, Maximally Connected, and Super-Connected. Wiley.