手機打開
論文排版
Total-coloring of Sparse Graphs with Maximum Degree 6
【摘要】：
Given a graph G =(V, E) and a positive integer k, a k-total-coloring of G is a mapping ? : V ∪E →{1, 2, ···, k} such that no ...
問答
快捷付款方式
訂購知網(wǎng)充值卡
訂購熱線
幫助中心