Ganian, R., Khazaliya, L., Inerney, F. M., & Rocton, M. (2025). The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
Citazione stile Chigago Style (17a edizione)Ganian, Robert, Liana Khazaliya, Fionn Mc Inerney, e Mathis Rocton. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. 2025.
Citatione MLA (9a ed.)Ganian, Robert, et al. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. 2025.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.