In a k-coloring of a uniquely k-colorable graph, the subgraph induced by the union of any two color classes is connected.

• 貌似是说，从一个图中选取标有同类颜色的节点，这些节点构成的子图是连接的。是这样吗？