APA (7th ed.) Citation

Daamouch, M. (2025). Strong k-transitive oriented graphs with large minimum degree. Communications in Combinatorics & Optimization, 10(3), 681. https://doi.org/10.22049/cco.2024.29025.1815

Chicago Style (17th ed.) Citation

Daamouch, Moussa. "Strong K-transitive Oriented Graphs with Large Minimum Degree." Communications in Combinatorics & Optimization 10, no. 3 (2025): 681. https://doi.org/10.22049/cco.2024.29025.1815.

MLA (9th ed.) Citation

Daamouch, Moussa. "Strong K-transitive Oriented Graphs with Large Minimum Degree." Communications in Combinatorics & Optimization, vol. 10, no. 3, 2025, p. 681, https://doi.org/10.22049/cco.2024.29025.1815.