For a graph G and a tree-decomposition (T,B) of G, the chromatic number of (T,B) is the maximum of chi(G[B]), taken over all bags B is an element of B. The tree-chromatic number of G is the minimum chromatic number of all tree-decompositions (T,B) of G. The path-chromatic number of G is defined analogously. In this article, we introduce an operation that always increases the path-chromatic number of a graph. As an easy corollary of our construction, we obtain an infinite family of graphs whose path-chromatic number and tree-chromatic number are different. This settles a question of Seymour (J Combin Theory Ser B 116 (2016), 229-237). Our results also imply that the path-chromatic numbers of the Mycielski graphs are unbounded. (C) 2017 Wiley Periodicals, Inc.
