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

貌似，一个图中选取标有同颜色节点，这些节点子图连接。这样吗？