Preprint
Aug 2026
A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability
Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph in $\mathcal{F}$. A wide range of relaxations of graph isomorphism arise this way: isomorphism itself over the class of all graphs [Lov\'asz, Acta Math. Hung. 1967],...
Radu Curticapean, Daniel Neuen, Amir Nikabadi et al.
· 0 citations