他们几乎完全刻画了唯一3 -列表可染完全多部图。
They almost completely characterized the uniquely 3-list colorable complete multipartite graphs.
并确定了路、圏和完全多部图的控制临界数的精确值。
The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph.
并确定了路、圏和完全多部图的控制临界数的精确值。
The best possible upper bound of a graph is determined, the exact values are also determined for path, cycle and complete multipart graph.
应用推荐