Arvind, V., Köbler, J., Rattan, G., & Verbitsky, O. (2017). Graph Isomorphism, Color Refinement, and Compactness. Computational complexity, 26(3), 627-685. https://doi.org/10.1007/s00037-016-0147-6
Citácia podle Chicago (17th ed.)Arvind, V., Johannes Köbler, Gaurav Rattan, a Oleg Verbitsky. "Graph Isomorphism, Color Refinement, and Compactness." Computational Complexity 26, no. 3 (2017): 627-685. https://doi.org/10.1007/s00037-016-0147-6.
Citácia podľa MLA (8th ed.)Arvind, V., et al. "Graph Isomorphism, Color Refinement, and Compactness." Computational Complexity, vol. 26, no. 3, 2017, pp. 627-685, https://doi.org/10.1007/s00037-016-0147-6.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..