Color refinement for relational structures
From MaRDI portal
Cites work
- An optimal lower bound on the number of variables for graph identification
- Color refinement, homomorphisms, and hypergraphs
- Constraint solving via fractional edge covers
- Counting bounded tree depth homomorphisms
- Counting homomorphisms from hypergraphs of bounded generalised hypertree width: a logical characterisation
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Dimension reduction via colour refinement
- Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphism, color refinement, and compactness
- Graph theory (to appear)
- Graphs Identified by Logics with Counting
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- Logical equivalences, homomorphism indistinguishability, and forbidden minors
- Lov\'asz Meets Weisfeiler and Leman
- On homomorphism indistinguishability and hypertree depth
- On recognizing graphs by numbers of homomorphisms
- On the Desirability of Acyclic Database Schemes
- On the Restraining Power of Guards
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Power of Natural Semijoins
- Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- The pebble-relation comonad in finite model theory
- Tight lower and upper bounds for the complexity of canonical colour refinement
- Weisfeiler-Lehman graph kernels
This page was built for publication: Color refinement for relational structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310263)
