I think a graph-based BFS constructive traversal & coloring algorithm can proof this. The theoretical base is binary logic on graph construction's " wave front".
【在 t*******r 的大作中提到】 : I think a graph-based BFS constructive traversal & coloring algorithm can : proof this. The theoretical base is binary logic on graph construction's " : wave front".
上集合论的意思是。。。图论的图形只是看看,证明需要集合逻辑, 比如 any 算子,exist 算子。。。当然不要那么学究,写成 自然语言表述。。。等我忙完回来写完那个证明。。。 另外 edge degree > 1 就别画成简单线型,你可以画成 star model 或者 spanning tree 啥的。。。
【在 t*******r 的大作中提到】 : I think a graph-based BFS constructive traversal & coloring algorithm can : proof this. The theoretical base is binary logic on graph construction's " : wave front".