APA (7th ed.) Citation

Shu, Q., & Lin, G. (2024). Planar graphs are acyclically edge (Δ+5)-colorable. Journal of Combinatorial Optimization, 47(4), 1. https://doi.org/10.1007/s10878-024-01165-3

Chicago Style (17th ed.) Citation

Shu, Qiaojun, and Guohui Lin. "Planar Graphs Are Acyclically Edge (Δ+5)-colorable." Journal of Combinatorial Optimization 47, no. 4 (2024): 1. https://doi.org/10.1007/s10878-024-01165-3.

MLA (9th ed.) Citation

Shu, Qiaojun, and Guohui Lin. "Planar Graphs Are Acyclically Edge (Δ+5)-colorable." Journal of Combinatorial Optimization, vol. 47, no. 4, 2024, p. 1, https://doi.org/10.1007/s10878-024-01165-3.