Announcement_45

New preprint: In A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability (with Radu Curticapean, Daniel Neuen, Amir Nikabadi, and Ben Young), we show that homomorphism indistinguishability over MSO-definable graph classes of bounded cliquewidth is decidable. To that end, we design a dense Weisfeiler-Leman algorithm.