 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   coloring of a graph 的翻译结果: 查询用时：0.008秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  coloring of a graph 图着色(1)图的着色(0)  图着色
 To introduce a new coloring of a graph, the definition of the game coloring Ⅱ of graph G and the chromatic number χ * g (G) of a graph are given. 介绍了一种新的图着色——关于图 G的对策色数 和对策色数χ*g ( G) . 短句来源 “coloring of a graph”译为未确定词的双语例句
 A coloring of a graph G=(V,E)is a partition ∏={V_1,V_2,…,V_k}of the vertices of G into independent sets or color classes. 图G=(V,E)的一个正常k-着色实际上是将G的顶点划分为独立集,记为∏={V1,V2,…,Vk}. 短句来源 For two integers 1 ≤ d ≤ k,a k/d-circular coloring of a graph G is a mapping c : V(G) → {0,1... k — 1} such that d v |c(u) — c(v)| ≤ k — d whenever uv ∈ E(G). 对两个正整数1≤d≤k，图G的k/d圆着色是映射c：V(G)(?) {0，1，…，k-1}满足：当uv∈E(G)时，d≤|c(u)-c(v)|≤k-d。 短句来源 A coloring of a graph G=(V,E) is a partition ={V_1,V_2,…,V_k} of the vertices of G into independent sets or color classer. 图G=(V,E)的一个正常着色就是将G的顶点划分为独立集,或称之为色类,记为 ={V1,V2,…,Vk}. 短句来源 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 dynamic coloring of a graph is a new concept which is introduced by Bruce Montgomery in 2001.This paper proves that the dynamic chromatic number of Halin graphs and Series-Parallel which is not 5-cycle is not more than four. 图的动态着色是BruceMontgomery于2001年引入的一个新概念。 本文分别证明了Halin图和非5圈的Series Parallel图的动态色数都不超过4。 短句来源 更多 相似匹配句对
 For a graph G. 对于图G. 短句来源 Graph Coloring Algorithm 关于图染色的算法 短句来源 Let G be a graph. 设G是一个图。 短句来源 The Similarity of A Graph 树的相似度 短句来源 On Some Coloring of Graph 图的染色 短句来源 查询“coloring of a graph”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  coloring of a graph
 A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. An edge-coloring of a graph G is to color all the edges of G so that any two adjacent edges are colored with different colors. An edge coloring of a graph H is called rainbow if no two edges of H have the same color. We generalize the concept of a 2-coloring of a graph to what we call a semi-balanced coloring by relaxing a certain discrepancy condition on the shortest-paths hypergraph of the graph. A relaxed coloring of a graph with respect to P is an assignment of colors to vertices of G so that each color class induces a graph which is the disjoint union of members of P. 更多 Let Ar=(a1,a2,…,ar),a'is integers≥2, r≥1. By an Ar-coloring of a graph G the authors mean a coloring of the edges of G by distinct colors c1,c2, …,cr,so that there are no complete subgraphs on ai vertices whose edges are co1ored in ci(i=1,2,…,r).Let HlN denote the set of all graphs on N vertices which do not contain comp1ete subgraph on l yertices. Let N(Ar,l) denote the minimum N so that there exists a graph G∈HlN which cannot be Ar-colored. In this paper, the authors define a kind of... Let Ar=(a1,a2,…,ar),a'is integers≥2, r≥1. By an Ar-coloring of a graph G the authors mean a coloring of the edges of G by distinct colors c1,c2, …,cr,so that there are no complete subgraphs on ai vertices whose edges are co1ored in ci(i=1,2,…,r).Let HlN denote the set of all graphs on N vertices which do not contain comp1ete subgraph on l yertices. Let N(Ar,l) denote the minimum N so that there exists a graph G∈HlN which cannot be Ar-colored. In this paper, the authors define a kind of critica1 graphs, and then using the critica1 graphs of H5(N-1),construct the critica1 graphs of H5N. By proving al1 the critica1 graphs of H5(12) can be (3,3)-colorcd, the authors prove that all the graphs in H5(12) can be (3, 3)-colored, so the authors improve N((3,3),5)'s lower bound to N((3,3)5,5)≥13. Before this paper, the best bound of N((3,3), 5) is 10≤N((3,3),5)≤18. so far, l3≤N((3,3),5)≤18, given in this paper, is the best bound of N((3, 3), 5). 令阿Ａｒ＝（ａ_１，ａ_２，…，ａ_ｒ），其中整数ａ_ｉ≥２，ｒ≥１.所谓图Ｇ的Ａｒ着色即对 图Ｇ的边用不同的颜色ｃ_1ｃ_2,…,ｃ_ｒ着色，使得没有一个ａ_ｉ个顶点的完全子 图的所有边都着色ｃ_ｉ（ｉ＝１，２，…，ｒ）．令ＨlＮ为具有Ｎ个顶点但不包含l个顶 点的完全子图的图的集合，Ｎ（Ａr,l）表示Ｇ∈ＨlＮ但不能被 Ａ 着色的图具有的 最少顶点数。本文定义一种临界图，并在此基础上利用Ｈ５（Ｎ－１）的临界图构造Ｈ５Ｎ 的临界图。通过证明Ｈ５（１２）的临界图均能（３，３）着色，证明Ｈ５（１２）中的图均能（３，３） 着色，进而得出：１３＜Ｎ（（３，３），５）＜１８，优于前人得出的１０＜Ｎ（（３，３），５）＜１８的结 果． The proper vertex-coloring, edge-coloring and total-coloring of a graph are systematically analysed with a new construction of the energy funtion for Hopfield nueral network ,the corresponding coloring alogrithms are introduced and the computer simulation as well as the coloring results are presented. 应用Ｈｏｐｆｉｅｌｄ网络模型，系统地研究了图的正常ｋ－顶点着色，正常ｋ－边着色以及正常ｋ－全着色的具体算法，建立了相应的数学理论，改进了此领域内的某些工作。 Kempe's color-interchange method is generally used to make the coloring of a graph from one plan to another. However, it has been found that this technigue dosen't work under certain circumstance. To solve this problem,this paper gives a new method named transferring color-interchange, which is applicable to the coloring of a planar graph and is evident, clear and effective as well. 将图G的着色由一种变为另一种，通常用Kempe法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。 << 更多相关文摘 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社