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

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