Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9515909 | Journal of Combinatorial Theory, Series B | 2005 | 8 Pages |
Abstract
A graph K is called multiplicative if whenever a categorical product of two graphs admits a homomorphism to K, then one of the factors also admits a homomorphism to K. We prove that all circular graphs Kk/d such that k/d<4 are multiplicative. This is done using semi-lattice endomorphism in (the skeleton of) the category of graphs to prove the multiplicativity of some graphs using the known multiplicativity of the odd cycles.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Claude Tardif,