您要查找的是不是:
- plane graph formation 平面构成学
- Clearly each plane graph has exactly one unbounded face. 显然,每个平面图都有一个无界面。
- The above representation of a graph is said to be a plane graph. 一个图的如上所述的表示称为一个平面图。
- A plane graph together with the set of faces it determines is called a plane map. 一个平面图与它所确定的面的集的总体称为一个平面地图。
- A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices. 一个构形是面图的一连串连通的顶点与这些顶点的度。
- To use multiple chart types, choose the Chart Type command or the chart type group command (for example, Line Group) from the Graph Format menu. 如果您想使用多种图表类型,请从图表格式菜单中选取图表类型命令或图表类型组命令(如:折线图组)。
- A configuration is reducible if no minimal 5 chromatic plane graph can contain it. 如果没有极小5色平面图能包含某个构形,就说此构形是可约的。
- Velocity formula and acceleration formula of point in the plane graph is proved by means of complex vector,and a simple method to obtain the velocity and acceleration is proposed. 研究刚体的平面平行运动,用复矢量方法推导了平面图形内各点的速度、加速度关系式,给出了求解平面图形内各点速度、加速度的简捷方法。
- Using paralled mathematic induction method, it proved that maximum plane graph with any degree which is contructed by way of "adding point within plane"or" adding point at the edge" is 4-colorable. 运用“并行(或平行)数学归纳法”证明了由“面内加点”或“边上加点”方法所构造的任意阶极大平面图是可四着色的。
- It is also used by the LosFormatter class to provide object state graph formatting for various parts of the ASP.NET infrastructure. 它还被LosFormatter类用来为ASP.;NET基础结构的各部分提供对象状态图格式设置。
- The plane climbed until it was clear of the clouds. 飞机爬升穿出了云层。
- STUDY ON COLOR NUMBER OF MAXIMUM PLANE GRAPH 极大平面图的色数研究
- The flier is flying a new-type jet plane on trial. 飞行员正在驾驶一架新式喷气机作试验飞行。
- The structure of maximun plane graph 极大平面图的构造
- On the total coloring of double - outer plane graph 双外平面图的全染色
- The vectorial cut mode for two axis plane graph 二维图形的矢量裁剪法
- Colouring numbers of the plane graph 平面图的着色数
- plane graph of factor concentration 因子平面点聚图
- The landscape unrolled under the speeding plane. 大自然的景色展现在快速飞行的飞机之下。
- In Havel [2] (1969, Journal of Combinatorial Theory, 7:184~186), Havel provided that both 4-cycles and 5-cycles must be excluded to ensure that the plane graphs are 3-colorable. Havel给出两个反例;如果平面图含有4-圈或有5-圈是不可3-可着色的;因此4-圈和5-圈在证明平面图是3-可着色时必须排除.