|
|||||
|
|
Construction of uniquely H‐colorable graphs |
|
| Authors: | Xuding Zhu |
| Abstract: | 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 |
| Keywords: | uniquely H‐colorable large odd girth homomorphism constructive proof |