APA (7th ed.) Citation

Chen, M., & Xie, Q. (2025). An upper bound for a ramsey type problem for k-connected subgraphs. Graphs and combinatorics, 41(6), 128. https://doi.org/10.1007/s00373-025-02993-8

Chicago Style (17th ed.) Citation

Chen, Murong, and Qiqin Xie. "An Upper Bound for a Ramsey Type Problem for K-connected Subgraphs." Graphs and Combinatorics 41, no. 6 (2025): 128. https://doi.org/10.1007/s00373-025-02993-8.

MLA (9th ed.) Citation

Chen, Murong, and Qiqin Xie. "An Upper Bound for a Ramsey Type Problem for K-connected Subgraphs." Graphs and Combinatorics, vol. 41, no. 6, 2025, p. 128, https://doi.org/10.1007/s00373-025-02993-8.