Distinguishing graphs by their left and right homomorphism profiles
From MaRDI portal
Publication:648964
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3836093 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2038883 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- A Class Of Abelian Groups
- A Tutte Polynomial for Coloured Graphs
- A note on chain lengths and the Tutte polynomial
- Algebraic Graph Theory
- An extension of the bivariate chromatic polynomial
- Colorings and orientations of graphs
- Contraction-deletion invariants for graphs
- Counting graph homomorphisms
- Dual graph homomorphism functions
- Fourier analysis on finite abelian groups: some graphical applications
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- Graphs determined by polynomial invariants
- Homomorphisms and polynomial invariants of graphs
- Locally grid graphs: Classification and Tutte uniqueness
- On chromatic and flow polynomial unique graphs
- On graphs determined by their Tutte polynomials
- Operations with structures
- Reflection positivity, rank connectivity, and homomorphism of graphs
- The bivariate Ising polynomial of a graph
- The enumeration of vertex induced subgraphs with respect to the number of components
- The rank of connection matrices and the dimension of graph algebras
- The search for chromatically unique graphs
- The search for chromatically unique graphs. II
- Tutte uniqueness of locally grid graphs
- Which graphs are determined by their spectrum?
Cited in
(8)- Note on the subgraph component polynomial
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- How I got to like graph polynomials
- Constructing cospectral graphs via a new form of graph product
- The Feynman identity for planar graphs
- Homomorphisms between graphs embedded in surfaces
- Polynomial graph invariants from homomorphism numbers
- Bipartition polynomials, the Ising model, and domination in graphs
This page was built for publication: Distinguishing graphs by their left and right homomorphism profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648964)