Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.

Eva Fluck, Tim Seppelt, Gian Luca Spitzer

Browse the full CSL paper archive.