Aloupis, G., Biniaz, A., Bose, P., De Carufel, J., Eppstein, D., Maheshwari, A., . . . Valtr, P. (2025). Noncrossing Longest Paths and Cycles: Noncrossing Longest Paths and Cycles. Graphs and combinatorics, 41(6), 122. https://doi.org/10.1007/s00373-025-02985-8
Citace podle Chicago (17th ed.)Aloupis, Greg, et al. "Noncrossing Longest Paths and Cycles: Noncrossing Longest Paths and Cycles." Graphs and Combinatorics 41, no. 6 (2025): 122. https://doi.org/10.1007/s00373-025-02985-8.
Citace podle MLA (9th ed.)Aloupis, Greg, et al. "Noncrossing Longest Paths and Cycles: Noncrossing Longest Paths and Cycles." Graphs and Combinatorics, vol. 41, no. 6, 2025, p. 122, https://doi.org/10.1007/s00373-025-02985-8.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..