Bin Chen, Xinmin Hou, Gexin Yu, Xinyu Zhou. A New Connectivity Bound for a Tournament to be Highly Linked. // Graphs and Combinatorics. – 2025. – DOI: 10.1007/s00373-025-02970-1. – URL: https://doi.org/10.1007/s00373-025-02970-1
Bin Chen, Xinmin Hou, Gexin Yu, & Xinyu Zhou (2025). A New Connectivity Bound for a Tournament to be Highly Linked. Graphs and Combinatorics. https://doi.org/10.1007/s00373-025-02970-1
Bin Chen, et al. “A New Connectivity Bound for a Tournament to be Highly Linked.” Graphs and Combinatorics, 2025. doi:10.1007/s00373-025-02970-1.
@article{Chen2025,
title = {A New Connectivity Bound for a Tournament to be Highly Linked},
author = {Chen, Bin and Hou, Xinmin and Yu, Gexin and Zhou, Xinyu},
journal = {Graphs and Combinatorics},
year = {2025},
doi = {10.1007/s00373-025-02970-1},
url = {https://doi.org/10.1007/s00373-025-02970-1}
}