助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   coloring number 的翻译结果: 查询用时:0.183秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

coloring number
相关语句
  着色数
     Adjacent Strong Edge Coloring Number of Graphs
     图的相邻强边着色数(英文)
短句来源
     Using extension and adjustment of graphs we give a distance partition of G, obtain the upper bound of conditional coloring number of G and the graphs satisfying this bound.
     本文引入了颜色扩展和颜色调整的方法,对图G进行了关于两个相邻顶点的距离分划,并分层分情形讨论,最后得到了条件着色数的上界和达到上界的图类。
短句来源
     The coloring number of the graph which is triangle free and can be embedded on the Klein bottle or the torus is no more than 4. In this paper, the following conclusion is proved:The coloring number of the graph with girth no less than 6 and can embedded on the oriented surface with genus 2 or non-oriented surface with genus 3 is no more than 4.
     任何一个嵌入到Klein瓶上或环面上的图 ,若无三角形其着色数最多是 4 .这里证明 :在围长不少于 6的可嵌入到亏格为 2的可定向曲面上或嵌入到亏格为 3的不可定向曲面上图的着色数最多是 4 .
短句来源
  色数
     Cai and Zhu showed that the game coloring number of the line graph of F is at most Δ+2. This paper shows that the complete game coloring number of the line graph of F is at most Δ+2.
     Cai和Zhu已证明了F的线图的游戏色数不超过Δ+2 .本文证明了F的线图的完全游戏色数不超过Δ+2 .
短句来源
     It is proved that incidence chromatic number of Pseudo-Halin graphs is lower than or equal to + 2.It is proved that Pseudo-Halin graphs with A = 4 or5 has total chromatic number +1 ,and the total coloring number of 3-regular Halin graphs is lower than or equal to 5.At last ,it is proved that the complete coloring number of Pseudo-Halin graphs with A = 4 or5 is lower than or equal to 7.
     证明了伪-Halin图关联色数不超过Δ+2,确定了Δ=4或5的伪-Halin图的全色数为Δ+1,证明了3-正则Halin图的全色数不超过5,Δ=4或5的伪-Halin图的完备色数不超过7。
短句来源
     Brualdi and Massey defined the incidence coloring number in 1993,it has some relations with the strong chromatic number.
     图的关联色数的概念是 Brualdi和 Massey于 1 993年引入的 ,它同图的强色指数有密切的关系 .
短句来源
     Richard A. Brualdi and J. Quinn Massey introduced the incidence coloring number in [1], and gave its conjecture, i.e. every graph G can be incidently colored with Δ(G)+2 kinds of colors.
     Richard A. Brualdi 和 J. Quinn Massey 在[1] 中引入了图的关联色数,并且提出了关联色数猜想,即:每一个图 G 都可以用Δ( G) + 2 种色正常关联着色。
短句来源
     The minimum cardinality of C for which there exists an incidence coloring π: I(G) -C is called the incidence coloring number of G .
     映射π是图G的一个关联着色,使得G是k-可关联着色的最小的k值称为G的关联色数
短句来源
更多       
  染色数
     Game Coloring Number of Flowers
     花形图的对策染色数(英文)
短句来源
     A connected graph is called a flower if it contains no a cycle of length greater than 3. In this paper, we prove that every flower has the game coloring number at most 5.
     如果一个连通图不包含长度大于或等于 4的圈 ,那么这个图被称为花形图 . 在这篇文章中 ,我们证明了每一个花形图的对策染色数至多为 5 .
短句来源
  “coloring number”译为未确定词的双语例句
     On the Total coloring number of P_m×P_n
     P_m×P_n的全色数
短句来源
     The experimental results indicate that the incident coloring number of graphs can be obtained by this genetic algorithm, and the solutions with excellent quality of problem can be obtained.
     实验结果表明 ,本文设计的遗传算法可以很好的对关联着色猜想进行求解 ,获得问题的高质量的解。
短句来源
     Inthis paper,we will obtainthe adjacent vertex-distinguishing total coloring number of general θ-graph.
     本文给出了广义θ-图的邻点可区别的全染色.
短句来源
查询“coloring number”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  coloring number
A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.
      
Finally we prove bounds on the (a, 1)-game coloring number when a >amp;lt; k.
      
This extends a fundamental result on the (1, 1)-game coloring number of trees.
      
Our main result is that if G has an orientation with maximum outdegree k then the (k, 1)-game coloring number of G is at most 2k + 2.
      
The (a, b)-game coloring number of G is the minimum score that Alice can obtain regardless of Bob's strategy.
      
更多          


In this paper the coloring problem of points have been analysed for a nonplanar nondirectional simple diagram,the coloring numbers algorithm of points is proposed.This algorithm gave not only the method to solve the coloring numbers of points on a nonplanar diagram,also the theorems of related properties in this algorithm are proofed.

本文对非平面无向简单图的点着色问题进行分析研究后,提出了一个点色数算法该算法不仅给出了非平面图求点色数的方法,同时也解决了着色方法并且对算法所涉及的有关性质定理给出了证明

Richard A.Brualdi and J.Quinn Massey introduced the incidence coloring number in [1], and gave its conjecture, i.e. every graph G can be incidently colored with Δ(G)+2 kinds of colors. The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.

Richard A. Brualdi 和 J. Quinn Massey 在[1] 中引入了图的关联色数,并且提出了关联色数猜想,即:每一个图 G 都可以用Δ( G) + 2 种色正常关联着色。本文的主要结果如下:我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想,进而确定了它们的关联色数。

Richard A.B rualdi and Jennifer J.Quinn Massey defined the incidence coloring in [1] and confectured: every graph can be incidence colored with △(G)+2 colors.B. Guiduli [2] showed that the concept of incidence coloring is a special case of directed star arboricity, introduced by I.Algor and N.Alon [3] and proved that the conjecture in [1] is false. According to a tight upper bound for directed star arboricity, he gave an upper bound for incidence coloring number, namely; Inc(G)≤△+O(log△), where △=△(G)....

Richard A.B rualdi and Jennifer J.Quinn Massey defined the incidence coloring in [1] and confectured: every graph can be incidence colored with △(G)+2 colors.B. Guiduli [2] showed that the concept of incidence coloring is a special case of directed star arboricity, introduced by I.Algor and N.Alon [3] and proved that the conjecture in [1] is false. According to a tight upper bound for directed star arboricity, he gave an upper bound for incidence coloring number, namely; Inc(G)≤△+O(log△), where △=△(G). chen etc.determined the incidence coloring number of some special graphs in [4]. In this paper, we give the incidence chromatic number of cartesian product of path and complete graph. According to the result we give the incidence chromatic number of K(n,m).

RichardA .Brualdi和J .QuinnMassey在 [1]中引入了图的关联着色概念 ,并且提出了关联着色猜想 ,即 :每一个图G都可以用Δ(G) +2种色正常关联着色 .B .Guiduli[2 ]说明关联着色的概念是I.Algor和N .Alon[3]提出的有向星荫度的一个特殊情况 ,并证实 [1]的关联着色猜想是错的 ,给出图G的关联色数的一个新的上界是Δ(G) +O(Log(ΔG) ) .[4 ]确定了某些特殊图类的关联色数 .本文给出了路和完全图的笛卡尔积图的关联色数 ,而且利用此结果又确定了完全图Kn 的广义图K(n ,m)的关联色数

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关coloring number的内容
在知识搜索中查有关coloring number的内容
在数字搜索中查有关coloring number的内容
在概念知识元中查有关coloring number的内容
在学术趋势中查有关coloring number的内容
 
 

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