Logical equivalences, homomorphism indistinguishability, and forbidden minors
From MaRDI portal
Publication:6647759
DOI10.1016/J.IC.2024.105224MaRDI QIDQ6647759
Publication date: 3 December 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparsity. Graphs, structures, and algorithms
- Semidefinite functions on categories
- Graph minors. V. Excluding a planar graph
- An optimal lower bound on the number of variables for graph identification
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Logical hierarchies in PTIME
- The chromatic number and other functions of the lexicographic product
- Discrete density comonads and graph parameters
- Quantum and non-signalling graph isomorphisms
- Beweis einer Abschwächung der Hadwiger-Vermutung
- On the cancellation law among finite relational structures
- Hadwiger’s Conjecture
- On recognizing graphs by numbers of homomorphisms
- Reflection positivity, rank connectivity, and homomorphism of graphs
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
- Homomorphisms are a good basis for counting small subgraphs
- Lov\'asz Meets Weisfeiler and Leman
- The Complexity of Homomorphism Indistinguishability
- Counting Bounded Tree Depth Homomorphisms
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Graph isomorphism in quasipolynomial time [extended abstract]
- Operations with structures
- Weisfeiler--Leman and Graph Spectra
- The pebble-relation comonad in finite model theory
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
This page was built for publication: Logical equivalences, homomorphism indistinguishability, and forbidden minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647759)
