Abstract
In this paper we investigate some colored notions of graph homomorphisms. We compare three different notions of colored homomorphisms and determine the number of such homomorphisms between several classes of graphs. More specifically, over all possible colorings of paths, we consider the colorings that yields the largest and smallest number of colored homomorphisms.
Citation
Colton Magnant. Chunwei Song. Suman Xia. "Colored graph homomorphisms." Rocky Mountain J. Math. 49 (8) 2717 - 2737, 2019. https://doi.org/10.1216/RMJ-2019-49-8-2717
Information
