… the number of homomorphisms from a tree to any graph by the … By using this algorithm and
some transformations on trees, … in graphs, we call a homomorphism from a tree to a graph a …

… In the sections on retracts, we prove that an isometric tree, and a shortest cycle, … homomorphism
order, ie, collections of incomparable graphs (graphs without homomorphisms between …

… that the chosen class of graphs is not distinguishing (eg, the class of graphs with tree-width
bounded by a … We construct a bijection between the homomorphisms from G to H1 and the …

… )/2 there is a choice between two vertices of the host graph Ck. Furthermore, adjacent vertices
of … First our algorithm transforms the given optimal tree decomposition of H into a nice tree …

… homomorphism numbers (called homomorphism densities) [2]. Grohe asks whether a similar
correspondence between dist∥·∥ and restricted homomorphism … tree distance δT of graphs…

… graphs and graph homomorphisms from both, a theoretical and a practical view point. A
homomorphism between two graphs … In [21] it is proved that there are oriented trees H and also …

… a regular tree, also known as a ``Cayley tree'' or ``Bethe lattice.'' Here the connection between
… When G is a regular tree, for any H and any set of activities on the nodes of H, certain well-…

… The set of all homomorphisms between two graphs can be endowed with a topological
structure, which turns out to be an important tool in the study of chromatic number. Ëee the book …

… a graph homomorphism if and only if ( f ( u ) , f ( v ) ) ∈ E H for all pairs ( u , v ) ∈ E G . We
write G → H if a graph homomorphism … As locally constrained homomorphisms between trees …

… There have been extensions of graph matching by allowing edges to map to paths, for trees
[… Nevertheless, (1-1) p-hom can be readily made symmetric that maps paths between G1 and …