APA (7th ed.) Citation

Priyamvada & Panda, B. (2023). Complexity and algorithms for injective edge coloring of graphs. Theoretical computer science, 968, 114010. https://doi.org/10.1016/j.tcs.2023.114010

Chicago Style (17th ed.) Citation

Priyamvada and B.S Panda. "Complexity and Algorithms for Injective Edge Coloring of Graphs." Theoretical Computer Science 968 (2023): 114010. https://doi.org/10.1016/j.tcs.2023.114010.

MLA (9th ed.) Citation

Priyamvada and B.S Panda. "Complexity and Algorithms for Injective Edge Coloring of Graphs." Theoretical Computer Science, vol. 968, 2023, p. 114010, https://doi.org/10.1016/j.tcs.2023.114010.