Akhoondian Amiri, S., Popa, A., Roghani, M., Shahkarami, G., Soltani, R., & Vahidi, H. (2025). Complexity of computing the anti-Ramsey numbers for paths. Theoretical computer science, 1044, 115271. https://doi.org/10.1016/j.tcs.2025.115271
Citace podle Chicago (17th ed.)Akhoondian Amiri, Saeed, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, a Hossein Vahidi. "Complexity of Computing the Anti-Ramsey Numbers for Paths." Theoretical Computer Science 1044 (2025): 115271. https://doi.org/10.1016/j.tcs.2025.115271.
Citace podle MLA (9th ed.)Akhoondian Amiri, Saeed, et al. "Complexity of Computing the Anti-Ramsey Numbers for Paths." Theoretical Computer Science, vol. 1044, 2025, p. 115271, https://doi.org/10.1016/j.tcs.2025.115271.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..