Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected

Zhen-Mu Hong, Zheng-Jiang Xia, Fu-Yuan Chen, Lutz Volkmann. Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected. Complexity, 2021, 2021. [doi]

Authors

Zhen-Mu Hong

This author has not been identified. Look up 'Zhen-Mu Hong' in Google

Zheng-Jiang Xia

This author has not been identified. Look up 'Zheng-Jiang Xia' in Google

Fu-Yuan Chen

This author has not been identified. Look up 'Fu-Yuan Chen' in Google

Lutz Volkmann

This author has not been identified. Look up 'Lutz Volkmann' in Google