APA (7th ed.) Citation

Duchêne, E., Gledel, V., Mc Inerney, F., Nisse, N., Oijid, N., Parreau, A., & Stojaković, M. (2025). Complexity of Maker–Breaker games on edge sets of graphs. Discrete Applied Mathematics, 361, 502-522. https://doi.org/10.1016/j.dam.2024.11.012

Chicago Style (17th ed.) Citation

Duchêne, Eric, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, and Miloš Stojaković. "Complexity of Maker–Breaker Games on Edge Sets of Graphs." Discrete Applied Mathematics 361 (2025): 502-522. https://doi.org/10.1016/j.dam.2024.11.012.

MLA (9th ed.) Citation

Duchêne, Eric, et al. "Complexity of Maker–Breaker Games on Edge Sets of Graphs." Discrete Applied Mathematics, vol. 361, 2025, pp. 502-522, https://doi.org/10.1016/j.dam.2024.11.012.