In a k-coloring of a uniquely k-colorable graph, the subgraph induced by the union of any two color classes is connected.
貌似是说,从中选取标有同类颜色节点,这些节点构子是连接。是这样吗?
In a k-coloring of a uniquely k-colorable graph, the subgraph induced by the union of any two color classes is connected.
貌似是说,从中选取标有同类颜色节点,这些节点构子是连接。是这样吗?
声明:以上例句、词性类均由互联网资源自动生,未经过人工审核,其表达内容亦不代表本软件观点;若发现问题,欢迎向我们指正。