Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm

DOI10.4230/LIPIcs.STACS.2020.43OpenAlexW3013311535MaRDI QIDQ5874317

Oleg Verbitsky, Johannes Käbler, Frank Fuhlbrück

Publication date: 7 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2020.43

zbMATH Keywords

graph isomorphismcoherent configurationsWeisfeiler-Leman algorithmCai-Fürer-Immerman graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

On WL-rank of Deza Cayley graphs ⋮ The Weisfeiler-Leman dimension of distance-hereditary graphs ⋮ On pseudofrobenius imprimitive association schemes ⋮ On the separability of cyclotomic schemes over finite fields

This page was built for publication: Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm