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

貌似是说，从一个图中有同颜色，这些构成子图是连接。是这样吗？