Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth. - Eva Fluck; Tim Seppelt; Gian Luca Spitzer (CSL, 2024)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. - Isolde Adler; Eva Fluck; Tim Seppelt; Gian Luca Spitzer (CoRR, 2025)