您要查找的是不是:
- Adjacent Strong Edge Coloring Number of Graphs 图的相邻强边着色数
- On The Adjacent Strong Edge Coloring of 1-Tree 1-树图的邻强边染色
- On the Adjacent Strong Edge Coloring of Monocycle Graph 单圈图的邻强边染色
- On the Adjacent Strong Edge Coloring of Halin Graphs Halin-图的邻强边染色(英文)
- A Note of Adjacent Strong Edge Coloring of Complete Graph with Even Order 偶阶完全图的邻强边染色法注
- The Hybrid Genetic Algorithms for the Adjacent Strong Edge Coloring of Graphs 用混合遗传算法求解图的邻强边着色问题
- On the Adjacent Strong Edge Coloring of Joining Graph with Star and Complete Balanced Bipartite Graph 星和完全等二部图联图的邻强边染色
- On the adjacent strong edge coloring of several class of complete 4-partite graphs 几类完全4-部图的邻强边染色
- adjacent strong edge coloring 邻强边染色
- Mody bright red powder. Bright shade strong edge coloring excellent, excellent hiding power. Light, the acid, alkali and so good. 鲜艳红色粉么。色光鲜艳浓厚,着色力极佳,遮盖力优良。耐晒性、耐酸性、耐碱性等均好。
- adjacent strong edge chromatic number 邻强边色数
- A Note of Adjacent Strong Edge Chromatic Number of Product Graphs 积图邻强边色数的注记
- Adjacent Strong Edge Chromatic Number of Series-Parallel Graphs 系列平行图的邻强边色数
- On the Adgacent Strong Edge Coloring of r-regular Partite Graph 一类正则二部图的邻强边染色
- On the Adjacent Strong Edge Chromatic Number of Path and Wheel Join-graph 路与轮联图的邻强边色数
- On the Adjacent Strong Edge Chromatica Number of some Special Complete r-partite Graphs 一类特殊完全r-部图的邻强边染色
- strong edge coloring 强边染色
- In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture. 第二章证明了由圈和路构成的(笛卡儿)积图满足图的边列表着色猜想。
- adjacent vertex-distinguishing acyclic edge coloring 邻点可区别无圈边染色
- Then, computes the edge information of the central pixels in every object area to eliminate strong edge noises and detect small target. 然后计算目标区域中心像素的边缘信息,进一步剔除强边缘噪声点,检测小目标。