On recognizing graphs by numbers of homomorphisms
From MaRDI portal
Recommendations
Cites work
- 6-transitive graphs
- An optimal lower bound on the number of variables for graph identification
- Contractors and connectors of graph algebras
- Distinguishing graphs by the number of homomorphisms
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- Linear time low tree-width partitions and algorithmic consequences
- Operations with structures
- The complexity of counting homomorphisms seen from the other side
Cited in
(58)- The recognition of the class of indecomposable digraphs under low hemimorphy
- Homomorphically full graphs
- Polyadic sets and homomorphism counting
- Fractional isomorphism of graphons
- Discrete density comonads and graph parameters
- Local WL invariance and hidden shades of regularity
- Recognizable series on graphs and hypergraphs
- On realizations of point determining graphs, and obstructions to full homomorphisms
- Some recognition problems related to graph isomorphism
- On counting homomorphisms to directed acyclic graphs
- Graph homomorphisms between trees
- scientific article; zbMATH DE number 2170450 (Why is no real title available?)
- Distinguishing graphs by the number of homomorphisms
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- On a theorem of Lovász that \((\cdot, H)\) determines the isomorphism type of \(H\)
- scientific article; zbMATH DE number 7297854 (Why is no real title available?)
- Counting bounded tree depth homomorphisms
- Perfect matchings, rank of connection tensors and graph homomorphisms
- On the Weisfeiler-Leman dimension of fractional packing
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Approximating fractionally isomorphic graphons
- Weisfeiler-Leman indistinguishability of graphons
- Efficiently recognizing graphs with equal independence and annihilation numbers
- Distinguishing graphs by their left and right homomorphism profiles
- The pebble-relation comonad in finite model theory
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
- Logical equivalences, homomorphism indistinguishability, and forbidden minors
- The pebble-relation comonad in finite model theory
- Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- On cospectral graphons
- Equality on all \#CSP instances yields constraint function isomorphism via interpolation and intertwiners
- On homomorphism indistinguishability and hypertree depth
- On a hierarchy of spectral isomorphism invariants
- When do homomorphism counts help in query algorithms?
- Homomorphism-distinguishing closedness for graphs of bounded tree-width
- The complexity of homomorphism reconstructibility
- On a hierarchy of spectral invariants for graphs
- Modal logic with relations over paths: a theoretical development through comonadic semantics
- On algorithms based on finitely many homomorphism counts
- Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements
- On the expressibility of the reconstructional color refinement
- Fractionally isomorphic graphs and graphons (extended abstract)
- The complexity of homomorphism reconstructibility
- The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems
- Monotonicity of the cops and robber game for bounded depth treewidth
- An algorithmic meta theorem for homomorphism indistinguishability
- Graph similarity and homomorphism densities
- Logarithmic Weisfeiler-Leman identifies all planar graphs
- Homomorphism counts to trees
- Computational complexity of the Weisfeiler-Leman dimension
- Finite variable counting logics with restricted requantification
- Computational complexity of the Weisfeiler-Leman dimension
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Adaptive query algorithms for relational structures based on homomorphism counts
- Color refinement for relational structures
- Homomorphism indistinguishability and game comonads for restricted conjunction and requantification
- Dual graph homomorphism functions
This page was built for publication: On recognizing graphs by numbers of homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057061)
