APA (7th ed.) Citation

Alecu, B., Kanté, M. M., Lozin, V., & Zamaraev, V. (2024, February 19). Lettericity of graphs: An FPT algorithm and a bound on the size of obstructions. Algorithmica. https://doi.org/10.48550/arXiv.2402.12559

Chicago Style (17th ed.) Citation

Alecu, Bogdan, Mamadou Moustapha Kanté, Vadim Lozin, and Viktor Zamaraev. "Lettericity of Graphs: An FPT Algorithm and a Bound on the Size of Obstructions." Algorithmica 19 Feb. 2024. https://doi.org/10.48550/arXiv.2402.12559.

MLA (9th ed.) Citation

Alecu, Bogdan, et al. "Lettericity of Graphs: An FPT Algorithm and a Bound on the Size of Obstructions." Algorithmica, 19 Feb. 2024, https://doi.org/10.48550/arXiv.2402.12559.