line critical graph 线临界图
point-critical graph 点临界图
-critical graph 临界图
critical-graph 临界图
k-critical graph k临界图
V-critical graph 顶点临界图
a critical graph 临界图
edge critical graph 边临界图
Corollary 2. 1. 2 Every fractional colour-critical graph is 2-connected.
推论2．1．2每个分数染色临界图是2连通的。
参考来源 - 图的分数染色An algorithm for constructing the critical graph not containing Cm and an algorithm for coloring the edges of a graph with two colors are given in this dissertation.
本文研制了构造不含圈Cm的临界图算法和对一个图的所有边进行两着色的算法。
参考来源 - 若干图的Ramsey数研究·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
In order to determine whether exist chromatic index critical graph of order 14, we should determine chromatic index critical of order 13 at first.
要想确定是否存在14阶色指数临界图，首先需要确定出13阶临界图的结构和特征。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
论述了图论的技术以及项目管理技术，并且根据图论技术和项目管理技术设计出了关键路径算法以及网络图绘制算法。
应用推荐