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

貌似是说，从中选取标有同颜色的，这构成的子是连接的。是这样吗？