Premium
Construction of uniquely H ‐colorable graphs
Author(s) -
Zhu Xuding
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199901)30:1<1::aid-jgt1>3.0.co;2-p
Subject(s) - mathematics , combinatorics , discrete mathematics
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