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
Citace podle Chicago (17th ed.)Chen, Murong, a 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.
Citace podle MLA (9th ed.)Chen, Murong, a 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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..