 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   coloring 在 数学 分类中 的翻译结果: 查询用时：0.165秒 在分类学科中查询 所有学科 数学 金属学及金属工艺 园艺 美术书法雕塑与摄影 外国语言文字 无机化工 有机化工 工业通用技术及设备 中国文学 更多类别查询 历史查询  coloring 着色(742)染色(316)  着色
 Total Coloring of Composition Graphs 合成图的全着色 短句来源 A new research for the coloring algorithm 新着色算法的研究 短句来源 The Coloring and Chromatic Sum of Graph 图的着色与色和 短句来源 Total Coloring of 3-Regular Graph 3_正则图的全着色 短句来源 Graphic Coloring Algorithms Based on Hopfield Network 基于Hopfield网络的图的着色算法 短句来源 更多 染色
 An Equitable Vertex Coloring of the De Bruijn Graph and a Vertex Coloring Theorem of Linedigraphs De Bruijn图的均匀顶点染色和有向图线图的一个顶点染色定理 短句来源 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图的边列表染色 短句来源 更多 “coloring”译为未确定词的双语例句
 Graph Coloring Algorithm 关于图染色的算法 短句来源 Two Results on Edge Coloring of Multigraph 重图边着色的两个新结果 短句来源 SUFFICIENT CONDITION ON 4-PROER COLORING WITH GRAPH G 图G可4－着色的充分条件 短句来源 The Application of Special Real Symmetric Matrix in Coloring of a Graph 特殊的实对称矩阵在图着色中的应用 短句来源 Let brk(Kt,t) be the minimum integer such that in any edge coloring of Kn,nwith K colors there is a monochromatic Kt,t,and let Z(n,t) be the maximum number of edges in a subgraph Kn,n of that contains no Kt,t. 在对完全二部图Kn,n进行k-边着色中,记brk(Kt,t)为能够诱导出单色Kt,t的最小的正整数n,另外,记z(n;t)为Kn,n中不含子图Kt,t最大的边数。 短句来源 更多 查询“coloring”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  coloring
 Is there a normalPk coloring usingr colors for a given graph? This problem is called the (k, r) path chromatic number problem of graphs. The choice number of a graph G, denoted by xl(G), is the minimum number k such that if a list of k colors is given to each vertex of G, there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. The experiments were performed with the callus cultures of the cells of ginseng (Panax ginseng), red root puccoon (Lithospermum arythrorhizon), and macrotomia coloring (Macrotomia euchroma) onboard the orbital station Mirand American Space Shuttle. Effect of coloring impurities on the absorption in neodymium phosphate laser glass at a lasing wavelength Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs 更多 On the basis of P. Kelly's theorem, in §1—§5 the writer investigates at large the r. c. from the structural form in which the(n—2)—order derived subgraphs of a n-Points graph G occur in G. With the concepts of the structural matrix, the column-symmetry-preserving rearrangement of a symmetrical matrix, etc., We first establish some proposition equivalent to the r. e. Then, from the froms of the structural matrices, we pick out some classes of graphs (which include the P. Z. Chinn's resultas a particular case),... On the basis of P. Kelly's theorem, in §1—§5 the writer investigates at large the r. c. from the structural form in which the(n—2)—order derived subgraphs of a n-Points graph G occur in G. With the concepts of the structural matrix, the column-symmetry-preserving rearrangement of a symmetrical matrix, etc., We first establish some proposition equivalent to the r. e. Then, from the froms of the structural matrices, we pick out some classes of graphs (which include the P. Z. Chinn's resultas a particular case), of which the reconstructions are unique, and the essential diffieulties in the general case from the viewpoint of the structural matrices are analized. In §6, the reconstructions of partial labeled graphs, the problem of uniqueness of coloring graphs and the relationship between them are discussed. In §7 P. Kelly's theorem is extended to the hypergraphs. The problems and conjectures presented in this paper may stimulate a new approach to the r.c. and the problems related to it, and some of them may be of independent meaning in graph theory. §1—§5中,在P.Kelly定理的基础上,从n点图G的所有n-2阶导出子图在G中出现的结构形式来对重构猜想作一般的探讨。使用标号图的结构方阵等概念,建立重构猜想的一些等价命题。从结构方阵的形式划分出一些重构唯一的图类(其中包括P.Z.Chinn的结果),并分析一般情形的根本难点。§6中讨论部分标号图的重构与图的着色唯一性问题。§7中把P.Kelly定理推广于超图。文中各节所提出的一些问题与猜想,希望对于重构猜想提供一些新的思考途径,有些猜想在图论中有它的独立意义。 Coloring is an important realm it the graph theory. After the four-color theorem has bean verified, there still remains a hard nut to crack that what plane graph can be three-coloring. Fot this problem,there is now a solution: if the graph is Eulerian maximal plane graph, then x(G)=3. On the basisof studying 0-1 cycle sequence, this paper gives our the necessary and sufficient conditions for a plane graph G with x(G)=3. 染色问题是图论的一个重要领域，在四色定理得到证明［１］之后，仍然存在“什么样的平面图 可以３－染色？”这样的难题［２］．目前已有结果：“欧拉极大平面图Ｇ有ｘ（Ｇ）＝３”［３］、［４］，本 文在研究０－１循环排列的基础上给出了平面图Ｇ有Ｘ（Ｇ）＝３的充要条件． In this paper,a model-interval colouring of graphs was introduced,a polynomial algorithm for interval colouring of comparability graphs was presented and the algorithm for coloring of graphs was improved. 本文提出了图的区间着色模型,并对相容性图给出了区间着色的多项式算法,同时改进了求图的着色问题的算法。 << 更多相关文摘 相关查询

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

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