December 19, 2016 article Graph Isomorphism, Color Refinement, and Compactness Computational Complexity DOI: 10.1007/s00037-016-0147-6 OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 26 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Computational Complexity of the Weisfeiler-Leman Dimension 2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research 0 citations Graphs Identified by Logics with Counting 2021 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access 5 citations The Weisfeiler-Leman algorithm 2020 ACM SIGLOG News article Computer Science Advanced Graph Theory Research 24 citations The Iteration Number of Colour Refinement 2020 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access 1 citations 4 results References 0