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 the new notion of distinguishing homomorphisms. We prove that if a graph G satisfies the connected existentially closed property and admits a homomorphism to H, then it admits continuum-many distinguishing homomorphisms from G to H join K2. Applications are given to a family universal H-colourable graphs, for H a finite core.
Building similarity graph...
Analyzing shared references across papers
Loading...
Bonato et al. (Mon,) studied this question.
www.synapsesocial.com/papers/68a370e80a429f79733333f8 — DOI: https://doi.org/10.55016/ojs/cdm.v7i2.62161
Anthony Bonato
Dejan Delić
Contributions to Discrete Mathematics
Building similarity graph...
Analyzing shared references across papers
Loading...