Homomorphism-distinguishing closedness for graphs of bounded tree-width
From MaRDI portal
Cites work
- Algorithm engineering for color-coding with applications to signaling pathway detection
- An optimal lower bound on the number of variables for graph identification
- Counting bounded tree depth homomorphisms
- Graph searching and a min-max theorem for tree-width
- Homomorphism tensors and linear equations
- Homomorphisms are a good basis for counting small subgraphs
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
- Logical equivalences, homomorphism indistinguishability, and forbidden minors
- Lov\'asz Meets Weisfeiler and Leman
- On recognizing graphs by numbers of homomorphisms
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Operations with structures
- Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
- The Power of Counting Logics on Restricted Classes of Finite Structures
- Weisfeiler-Lehman graph kernels
Cited in
(7)- Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
- An algorithmic meta theorem for homomorphism indistinguishability
- Equi-rank homomorphism preservation theorem on finite structures
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Homomorphism indistinguishability and game comonads for restricted conjunction and requantification
- NPA hierarchy for quantum isomorphism and homomorphism indistinguishability
- Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
This page was built for publication: Homomorphism-distinguishing closedness for graphs of bounded tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902667)
