Dehghan, A., Sadeghi, M., & Ahadi, A. (2018). Sigma Partitioning: Complexity and Random Graphs. Discrete mathematics and theoretical computer science, 20 no. 2(Graph Theory), . https://doi.org/10.23638/DMTCS-20-2-19
Chicago-Zitierstil (17. Ausg.)Dehghan, Ali, Mohammad-Reza Sadeghi, und Arash Ahadi. "Sigma Partitioning: Complexity and Random Graphs." Discrete Mathematics and Theoretical Computer Science 20 no. 2, no. Graph Theory (2018). https://doi.org/10.23638/DMTCS-20-2-19.
MLA-Zitierstil (9. Ausg.)Dehghan, Ali, et al. "Sigma Partitioning: Complexity and Random Graphs." Discrete Mathematics and Theoretical Computer Science, vol. 20 no. 2, no. Graph Theory, 2018, https://doi.org/10.23638/DMTCS-20-2-19.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.