您要查找的是不是：
- A good wide piece of platinum gold, white gold and other precious metals pack K edge, the look noble and not tacky, expensive in the market. 好的广片用铂金、白色K金等贵金属包边后，显得高贵而不俗气，在市场中价格不菲。
- Given a (directed ) graph H, a (directed) graph G is ak-edge fault-tolerantgraph with respect to H, denoted k-EFT (H)graph, if G contains a spanning subgraph isomorphic to H after theremoval of any k edges from G. 给定一个（有向）图H，称（有向）图G为关于H的k-边容错图，记为k－EHT（H）图，若从G中移去任何k条边所得的每个图都含有生成子图同构于H。
- It is a developing tendency of microprossor monitor system to use color graph displaying the state signal of marine or industry system. 用彩色图形方法显示船舶或工业系统的状态信息是目前微机监测系统的发展方向.
- The parameters of period and thickness are adjusted so that the first Bragg peak appears at the Brewster angle when the photon energy is in the vicinity of K edge of carbon and L edge of silicon respectively. 通过对其相关参数周期数、厚度比以及周期厚度的调整 ,使薄膜的布拉格衍射峰出现在布儒斯特角附近 ,两种多层膜的应用能量范围分别落于C的近K边处和Si的L边前。
- In this paper,by using method of group theory, we proved that connected disdirected color graph G(F,S) of finite exchanged - group is Hamiltonian graph. 本文应用群论方法，证明了有限交换群的连通无向色图G（F，S）是Hamilton图。
- This paper proposed a color image segmentation algorithm based on dominant color graph (DCG) on the basis of the improvement of tri-dimensional conventional color histogram(CCH). 摘要在对三维传统的颜色直方图(CCH)作出了一系列改进的基础上，提出了一种基于主色外观图(DCG)的新的彩色图像分割方法。
- We will also study the uniquely 3 list colorable graphs and will find a necessary and sufficient condition of a uniquely 3 list colorable graph. 其次，对图的唯一 -列表染色进行了研究，给出了判断一个图为唯一3-列表可染色图的一个充要条件和一个充分条件，并且找到一类 数为4的平面图。
- The Edge Coloring of Double-outer Planar Graph 双外平面图的边染色
- ON t--EDGE COLORED COMPLETE GRAPH K_N OF ORDER N N阶完全图K_N的t边着色
- Taking the interfaco card of HAND WELL COLOR GRAPH ADAPTER as example, tthe modes and rules of the Chirnese display, the designing thought and techniques of the software are clearly and systematically explained in this parer. 以高精度显示接口板“HANDWELL COLOR GRAPH ADAPTER”为例,系统地介绍其汉字显示方式、规则以及软件的具体的设计思想和技巧。
- 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最大的边数。
- Let G and G, be graphs on n nodcs. G is k -edge fault tolerant with respect to Go, denoted by k -EFT(G0), if every graph obtained by removing any k edges from Gcontains a subgraph Go. 若图G小去掉任何k条边后所得的图含有生成子图同构于G0，则称G关于G0；
- In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture. 第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
- Mody bright red powder. Bright shade strong edge coloring excellent, excellent hiding power. Light, the acid, alkali and so good. 鲜艳红色粉么。色光鲜艳浓厚，着色力极佳，遮盖力优良。耐晒性、耐酸性、耐碱性等均好。
- HAMILTON PATH IN CAYLEY COLOR GRAPH Cayley色图中的Hamilton路
- character edge color variation feature 字符边缘颜色变化特征
- On the Adgacent Strong Edge Coloring of r-regular Partite Graph 一类正则二部图的邻强边染色
- On the Adjacent Strong Edge Coloring of Monocycle Graph 单圈图的邻强边染色
- The factory is situated on the edge of the town. 这座工厂坐落在该城的边上。
- The hotel is situated at the edge of the town. 该饭店坐落于市区的边缘。
