Mömke, T., Popa, A., Roshany-Tabrizi, A., Ruderer, M., & Vincze, R. (2025). Approximating Maximum Edge 2-Coloring by Normalizing Graphs. Discrete mathematics and theoretical computer science, 27:2(Discrete Algorithms), . https://doi.org/10.46298/dmtcs.13212
Chicago Style (17th ed.) CitationMömke, Tobias, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, and Roland Vincze. "Approximating Maximum Edge 2-Coloring by Normalizing Graphs." Discrete Mathematics and Theoretical Computer Science 27:2, no. Discrete Algorithms (2025). https://doi.org/10.46298/dmtcs.13212.
MLA (9th ed.) CitationMömke, Tobias, et al. "Approximating Maximum Edge 2-Coloring by Normalizing Graphs." Discrete Mathematics and Theoretical Computer Science, vol. 27:2, no. Discrete Algorithms, 2025, https://doi.org/10.46298/dmtcs.13212.