(2026). Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth."
Logical Methods in Computer Science 2026.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth."
Logical Methods in Computer Science, 2026.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.