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
Citácia podle Chicago (17th ed.)Dehghan, Ali, Mohammad-Reza Sadeghi, a 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.
Citácia podľa MLA (8th ed.)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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..