助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[299]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
染色
    THE SYNTHESIS OF POLYESTER FIBRE COLORING MODIFIER SIPM FROM THE IPA IN LOW PURITY
    用低纯度IPA合成涤纶染色改性剂SIPM
    An Equitable Vertex Coloring of the De Bruijn Graph and a Vertex Coloring Theorem of Linedigraphs
    De Bruijn图的均匀顶点染色和有向图线图的一个顶点染色定理
    implanted by N+ with an energy of 20keV was measured by six methods including in situ pollen germination,Benzidine-α-Naphthol coloring,pollen tube quick germination,FDA fluorescence coloring,TTC coloring and pollen in vitro germination.
    品种苏棉12号的花粉为材料,用能量为20keV的N+注入花粉,分别用花粉原位萌发法、联苯胺-甲萘酚染色法、花粉管快速萌发法、FDA(荧光素二醋酸脂)染色法、TTC(2,3,5-氯代三苯基四氮唑)染色法和离体萌发法6种方法测定N+注入后的棉花花粉活力。
    A proper k-total coloringf of G(V,E) is said to be a k-equitable total coloring of graph G(V,E),if the number of vertices and edges in any two color classes differ at most one. χet(G)=min{k| G has a k-equitable total coloring} is called the equitable total chromatic number of G.
    对于图G(V,E)的正常k-全染色f称为G(V,E)的k-均匀全染色,当且仅当任意2个色类中的元素总数至多相差1.eχt(G)=min{k|G有k-均匀全染色}称为G的均匀全色数.
    The 2-distance coloring of a graph G is a proper vertex coloring such that no two vertices at distance less than or equal to 2 in G are assigned the same color.
    图G(V,E)的2-距离染色是指正常的顶点染色,且距离不大于2的任意两个顶点着不同的颜色.
    A total coloring approach is given for graph and the adjacent total coloring is proved. By using the approach,the total coloring of Pm×Pn is obtained: χt(Pm×Pn)=.
    给出了图的一种染色方法,并证明了该染色为正常全染色,从而得到了Pm×Pn的全色数:χt(Pm×Pn)=54!
    ON THE EDGE LIST COLORING OF SERIES-PARALLEL GRAPHS
    Series-Parallel图的边列表染色
    On The Adjacent Strong Edge Coloring of 1-Tree
    1-树图的邻强边染色
    Coloring Problem in Solving Graph with Genetic Algorithm
    遗传算法求解图的染色问题
    ON THE ADJACENT STRONG EDGE COLORING OF OUTER PLANAR GRAPHS WITH△(G)≤3
    △(G)=3的外平面图的邻强边染色
    Neural network model of equitable coloring of graphs
    图的均匀染色问题的神经网络模型
    On the Vertex Strong Total Coloring of Halin Graphs with△(G)≥6
    △(G)≥6的Halin图的点强全染色
    ADJACENT STRONG VERTEX-DISTINGUISHING TOTAL COLORING OF P_n~k(k≡2(mod 3))
    P_n~k(k≡2(mod3))的邻点可区别的强全染色
    On the Adjacent Strong Edge Coloring of Halin Graphs
    Halin-图的邻强边染色(英文)
    Adjacent Strong Edge coloring of Extended θ-Graph
    广义θ-图的邻强边染色
    On The Adjacent Strong Edge Coloring of θ-Graph
    θ-图的邻强边染色
    Adjacent-vertex-distinguishing Total Coloring on 2-connected Outer Plane Graph with△(G)=6
    关于△(G)=6的2-连通外平面图的邻点可区别全染色
    On the Vertex-distinguishing Proper Edge Coloring of K~c_4∨K_t
    图K_4~c∨K_t的点可区别正常边染色及其推广
    ON THE TOTAL COLORING AND ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF P_m∨S_m
    P_m∨S_n的邻点可区别全染色
    On the adjacent strong edge coloring of P_m×P_n and P_m×C_n
    P_m×P_n和P_m×C_n的邻强边染色
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社