Isolde Adler, Eva Fluck, Tim Seppelt, Gian Luca Spitzer. Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. Logical Methods in Computer Science, 22(2), 2026. [doi]
No references recorded for this publication.
No citations of this publication recorded.