Distinguishing homomorphisms of infinite graphs

Anthony Bonato, Dejan Delic

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to…