Multiplicative graphs and semi-lattice endomorphisms in the category of graphs

@article{Tardif2005MultiplicativeGA,
  title={Multiplicative graphs and semi-lattice endomorphisms in the category of graphs},
  author={Claude Tardif},
  journal={J. Comb. Theory, Ser. B},
  year={2005},
  volume={95},
  pages={338-345}
}
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. 
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Colouring of graphs with strongly independent colour classes

  • A. Gyarfas, T. Jensen, M. Stiebitz
  • 2002
Highly Influential
3 Excerpts

Structure of Graph Homomorphisms

  • R. Bač́ık
  • Ph. D. Thesis, Simon Fraser University,
  • 1997
2 Excerpts

Graph homomorphisms : structure and symmetry , Graph symmetry ( Montreal , PQ , 1996 ) , 107 – 166 , NATO Adv

  • C. Tardif G Hahn
  • 1988

On the arc-chromatic number of a digraph

  • S. Poljak, V. Rödl
  • J. Combin. Theory Ser. B
  • 1981
2 Excerpts

Homomorphisms of graphs and automata, University of Michigan

  • S. Hedetniemi
  • Technical Report 03105–44–T,
  • 1966
1 Excerpt

Similar Papers

Loading similar papers…