Summary: The notion of homomorphism-homogeneity, introduced by \textit{P. J. Cameron} and \textit{J. Nešetřil} [Comb. Probab. Comput. 15, No. 1--2, 91--103 (2006; Zbl 1091.08001)], originated as a variation on ultrahomogeneity. By fixing the type of finite homomorphism and global extension, several homogeneity classes, calledmorphism extension classes, can be defined. These classes are studied for various languages and axiom sets. \textit{D. Hartman} et al. [Eur. J. Comb. 35, 313--323 (2014; Zbl 1292.05110)] showed for finite undirected \(L\)-colored graphs without loops, where colors for vertices and edges are chosen from a partially ordered set \(L\), that when \(L\) is a linear order, the classes HH and MH of \(L\)-colored graphs coincide, contributing thus to a question of Cameron and Nešetřil [loc. cit.]. They also showed that the same is true for vertex-uniform finite \(L\)-colored graphs when \(L\) is a diamond. In this work, we extend their results to countably infinite \(L\)-colored graphs, proving that the classes MH and HH coincide if and only if \(L\) is a linear order.