1 paper
Wei Wang, Da Zhao
We provide a criterion to distinguish two graphs which are indistinguishable by 2-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost a…