Geodesic
Distinguishing graphs by the number of homomorphisms
Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 73-75 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

A homomorphism from one graph to another is a map that sends vertices to vertices and edges to edges. We denote the number of homomorphisms from G to H by |G → H|. If is a collection of graphs, we say that distinguishes graphs G and H if there is some member X of such that |G → X | ≠ |H → X|. is a distinguishing family if it distinguishes all pairs of graphs.
Keywords: graph homomorphism, chromatic number 
@article{DMGT_1995_15_1_a7,
     author = {Fisk, Steve},
     title = {Distinguishing graphs by the number of homomorphisms},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {73--75},
     year = {1995},
     volume = {15},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a7/}
}
TY  - JOUR
AU  - Fisk, Steve
TI  - Distinguishing graphs by the number of homomorphisms
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1995
SP  - 73
EP  - 75
VL  - 15
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a7/
LA  - en
ID  - DMGT_1995_15_1_a7
ER  - 
%0 Journal Article
%A Fisk, Steve
%T Distinguishing graphs by the number of homomorphisms
%J Discussiones Mathematicae. Graph Theory
%D 1995
%P 73-75
%V 15
%N 1
%U http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a7/
%G en
%F DMGT_1995_15_1_a7
Fisk, Steve. Distinguishing graphs by the number of homomorphisms. Discussiones Mathematicae. Graph Theory, Tome 15 (1995) no. 1, pp. 73-75. http://geodesic.mathdoc.fr/item/DMGT_1995_15_1_a7/

[1] [Lov71] L. Lovász, On the cancellation law among finite relational structures, Periodica Math. Hung. 1 (1971) 145-156, doi: 10.1007/BF02029172.