Elsevier

Discrete Mathematics

Volume 54, Issue 2, April 1985, Pages 127-132
Discrete Mathematics

Homomorphisms of 3-chromatic graphs

https://doi.org/10.1016/0012-365X(85)90073-1Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper examines the effect of a graph homomorphism upon the chromatic difference sequence of a graph. Our principal result (Theorem 2) provides necessary conditions for the existence of a homomorphism onto a prescribed target. As a consequence we note that iterated cartesian products of the Petersen graph form an infinite family of vertex transitive graphs no one of which is the homomorphic image of any other. We also prove that there is a unique minimal element in the homomorphism order of 3-chromatic graphs with non-monotonic chromatic difference sequences (Theorem 1). We include a brief guide to some recent papers on graph homomorphisms.

Cited by (0)