Construction of uniquely H‐colorable graphs
Xuding Zhu · Journal of Graph Theory · 1999
We shall prove that for any graph H that is a core, if χ(G) is large enough, then H × G is uniquely H-colorable. We also give a new construction of triangle free graphs, which are uniquely n-colorable. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 1–6, 1999