APA-Zitierstil (7. Ausg.)

Babu, J., Murali Krishnan, K., Prabhakaran, V., & Warrier, N. J. (2025). Computing eternal vertex cover number of maximal outerplanar graphs in linear time. Theoretical computer science, 1056, 115530. https://doi.org/10.1016/j.tcs.2025.115530

Chicago-Zitierstil (17. Ausg.)

Babu, Jasine, K. Murali Krishnan, Veena Prabhakaran, und Nandini J. Warrier. "Computing Eternal Vertex Cover Number of Maximal Outerplanar Graphs in Linear Time." Theoretical Computer Science 1056 (2025): 115530. https://doi.org/10.1016/j.tcs.2025.115530.

MLA-Zitierstil (9. Ausg.)

Babu, Jasine, et al. "Computing Eternal Vertex Cover Number of Maximal Outerplanar Graphs in Linear Time." Theoretical Computer Science, vol. 1056, 2025, p. 115530, https://doi.org/10.1016/j.tcs.2025.115530.